human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "differentially private oblivious ram"):
  Abstract: In this work, we investigate if statistical privacy can enhance the performance of ORAM mechanisms while providing rigorous privacy guarantees. We propose a formal and rigorous framework for developing ORAM protocols with statistical security viz., a differentially private ORAM (DP-ORAM). We present Root ORAM, a family of DP-ORAMs that provide a tunable, multi-dimensional trade-off between the desired bandwidth overhead, local storage and system security. #R##N#We theoretically analyze Root ORAM to quantify both its security and performance. We experimentally demonstrate the benefits of Root ORAM and find that (1) Root ORAM can reduce local storage overhead by more than 2X for a privacy budget of \epsilon = 4, significantly enhancing performance in memory limited platforms such as trusted execution environments, and (2) Root ORAM allows tunable trade-offs between bandwidth, storage, and privacy, reducing bandwidth overheads by upto 2X-10X (at the cost of increased storage/statistical privacy), enabling significant reductions in ORAM access latencies for cloud environments. We also analyze the privacy guarantees of DP-ORAMs through the lens of information theoretic metrics of Shannon entropy and Min-entropy [12]. Finally, Root ORAM is ideally suited for applications which have a similar access pattern, and we showcase its utility via the application of Private Information Retrieval.

Includes members:
  Member "sok cryptographically protected database search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timecrypt encrypted data stream processing at scale with cryptographic access control")
  Member "differential privacy as a mutual information constraint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local information privacy and its application to privacy preserving data aggregation")
  Member "rappor randomized aggregatable privacy preserving ordinal response":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally private hypothesis selection")
  Member "differential privacy an economic method for choosing epsilon":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "privacy preserving group data access via stateless oblivious ram simulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dr sgx automated and adjustable side channel protection for sgx using data location randomization")
  Member "towards practical oblivious ram":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic skyline queries on encrypted data using result materialization")
  Member "privacy preserving access of outsourced data via oblivious ram simulation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lower bounds for oblivious near neighbor search")
  Member "composition attacks and auxiliary information in data privacy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "local differential privacy for deep learning")

Question: Please tell me which class the source paper 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)