human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "datalair efficient block storage with plausible deniability against multi snapshot adversaries"
  Abstract: Sensitive information is present on our phones, disks, watches and computers. Its protection is essential. Plausible deniability of stored data allows individuals to deny that their device contains a piece of sensitive information. This constitutes a key tool in the fight against oppressive governments and censorship. Unfortunately, existing solutions, such as the now defunct TrueCrypt, can defend only against an adversary that can access a users device at most once (single-snapshot adversary). Recent solutions have traded significant performance overheads for the ability to handle more powerful adversaries, that are able to access the device at multiple points in time (multi-snapshot adversary). In this paper we show that this sacrifice is not necessary. We introduce and build DataLair, a practical plausible deniability mechanism. When compared with existing approaches, DataLair is two orders of magnitude faster for public data accesses, and 5 times faster for hidden data accesses. An important component in DataLair is a new write-only ORAM construction which improves on the complexity of the state of the art write-only ORAM by a factor of O(logN ), where N denotes the underlying storage disk size.

Connected through hyperedge HE-1 (induced by source paper "model checking quantitative hyperproperties"):
  with members:
    - "the density of linear time properties"
    - "plausible deniability for privacy preserving data synthesis"
    - "the complexity of counting models of linear time temporal logic"
    - "a temporal logic for hyperproperties"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "on bounding problems of quantitative information flow"

Connected through hyperedge HE-2 (induced by source paper "sqoram read optimized sequential write only oblivious ram"):
  with members:
    - "deterministic stash free write only oram"
    - "oblivisync practical oblivious file backup and synchronization"
    - "oblivious ram simulation with efficient worst case access overhead"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-3 (induced by source paper "deterministic stash free write only oram"):
  with members:
    - "oblivisync practical oblivious file backup and synchronization"
    - "a practical oblivious map data structure with secure deletion and history independence"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)