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: "accessing data while preserving privacy"
  Abstract: As organizations struggle with vast amounts of data, outsourcing sensitive data to third parties becomes a necessity. To protect the data, various cryptographic techniques are used in outsourced database systems to ensure data privacy, while allowing efficient querying. Recent attacks on such systems demonstrate that outsourced database systems must trade-off efficiency and privacy. Towards designing systems that strike a good balance between these two aspects, we present a new model of differentially private outsourced database systems, where differential privacy is preserved at the record level even against an untrusted server that controls data and queries. Beginning with an atomic storage model where the server can observe both the memory access pattern and communication volume, we provide upper- and lower-bounds on the efficiency of differentially private outsourced database systems. Our lower-bounds motivate the examination of models where the memory access pattern is kept hidden from the server. Combining oblivious RAM with differentially private sanitizers, we present a generic construction of differentially private outsourced databases. We have implemented our constructions and report on their efficiency.

Connected through hyperedge HE-1 (induced by source paper "what storage access privacy is achievable with small overhead"):
  with members:
    - "root oram a tunable differentially private oblivious ram"
    - "differentially private oblivious ram"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "calibrating data to sensitivity in private data analysis"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

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)