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 "bios oram improved privacy preserving data access for parameterized outsourced storage"):
  Abstract: Algorithms for oblivious random access machine (ORAM) simulation allow a client, Alice, to obfuscate a pattern of data accesses with a server, Bob, who is maintaining Alice's outsourced data while trying to learn information about her data. We present a novel ORAM scheme that improves the asymptotic I/O overhead of previous schemes for a wide range of size parameters for client-side private memory and message blocks, from logarithmic to polynomial. Our method achieves statistical security for hiding Alice's access pattern and, with high probability, achieves an I/O overhead that ranges from $O(1)$ to $O(\log^2 n/(\log\log n)^2)$, depending on these size parameters, where $n$ is the size of Alice's outsourced memory. Our scheme, which we call BIOS ORAM, combines multiple uses of B-trees with a reduction of ORAM simulation to isogrammic access sequences.

Includes members:
  Member "data oblivious graph algorithms in outsourced external memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exploring differential obliviousness")
  Member "the melbourne shuffle improving oblivious storage in the cloud":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of anonymous communication through public networks")
  Member "statistically secure oram with tilde o log 2 n overhead":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stronger lower bounds for online oram")
  Member "oblivious ram simulation with efficient worst case access overhead":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stronger lower bounds for online oram")
  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 "privacy preserving access of outsourced data via oblivious ram simulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for oblivious near neighbor search")

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)