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: "oblivious secure deletion with bounded history independence"
  Abstract: We present a new secure cloud storage mechanism that combines three previously disjoint security properties: obliviousness, secure deletion, and history independence. The system maintains strong privacy guarantees against a cloudobservation attack, wherein an attacker learns all previous states of, and accesses to, the persistent cloud storage, as well as a catastrophic attack, where the decryption keys from erasable memory are also leaked. In the first scenario, the access pattern reveals nothing about the contents (obliviousness), and in both scenarios, no previously deleted data is recoverable (secure deletion), and the structure of the data leaks a bounded amount of information about previous states (history independence). To achieve these goals we developed a new oblivious-RAM with variable-size storage blocks (vORAM) and a new history independent, randomized data structure based on B-trees (HIRB tree) stored within the vORAM. We prove that the vORAM+HIRB achieves obliviousness and secure deletion. We also show that any such system must inevitably leak a bounded amount of history information, and prove that our vORAM+HIRB construction matches this lower bound, up to logarithmic factors. Our system also provides better utilization of the ORAM buckets and reduces the amount of local storage requirements by O(logn) as compared to prior work for storing map data structures. Finally, we have implemented and measured the performance of our system using Amazon Web Services for a sample password-management application that maintains the privacy of login records, addition and removal of accounts, and password changes. The empirical performance is comparable to current state of the art in ORAM technologies and greatly outperforms naive approaches that provide the same security properties.

Connected through hyperedge HE-1 (induced by source paper "oblivious sorting and queues"):
  with members:
    - "a general multi party protocol for minimal communication and local computation"
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "privacy preserving data oblivious geometric algorithms for geographic data"

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)