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: "privacy preserving group data access via stateless oblivious ram simulation"
  Abstract: We study the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users. We show that such privacy-preserving data access is possible using a combination of probabilistic encryption, which directly hides data values, and stateless oblivious RAM simulation, which hides the pattern of data accesses. We give simulations that have only an $O(\log n)$ amortized time overhead for simulating a RAM algorithm, $\cal A$, that has a memory of size $n$, using a scheme that is data-oblivious with very high probability assuming the simulation has access to a private workspace of size $O(n^\nu)$, for any given fixed constant $\nu>0$. This simulation makes use of pseudorandom hash functions and is based on a novel hierarchy of cuckoo hash tables that all share a common stash. We also provide results from an experimental simulation of this scheme, showing its practicality. In addition, in a result that may be of some theoretical interest, we also show that one can eliminate the dependence on pseudorandom hash functions in our simulation while having the overhead rise to be $O(\log^2 n)$.

Connected through hyperedge HE-1 (induced by source paper "dr sgx automated and adjustable side channel protection for sgx using data location randomization"):
  with members:
    - "sgxpectre stealing intel secrets from sgx enclaves via speculative execution"
    - "hybcache hybrid side channel resilient caches for trusted execution environments"
    - "spectre attacks exploiting speculative execution"
    - "lazyfp leaking fpu register state using microarchitectural side channels"
    - "cachezoom how sgx amplifies the power of cache attacks"
    - "software grand exposure sgx cache attacks are practical"
    - "malware guard extension using sgx to conceal cache attacks"
    - "stacco differentially analyzing side channel traces for detecting ssl tls vulnerabilities in secure enclaves"

Connected through hyperedge HE-2 (induced by source paper "a double edged sword security threats and opportunities in one sided network communication"):
  with members:
    - "obladi oblivious serializable transactions in the cloud"
    - "the end of a myth distributed transactions can scale"
    - "rowhammer js a remote software induced fault attack in javascript"
    - "towards practical oblivious ram"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-3 (induced by source paper "lower bounds for oblivious data structures"):
  with members:
    - "bios oram improved privacy preserving data access for parameterized outsourced storage"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "decreasekeys are expensive for external memory priority queues"
    - "cell probe lower bounds for dynamic problems via a new communication model"
    - "new unconditional hardness results for dynamic and online problems"
    - "the cell probe complexity of dynamic range counting"
    - "lower bounds on near neighbor search via metric expansion"

Connected through hyperedge HE-4 (induced by source paper "mix oram using delegate shuffles"):
  with members:
    - "differentially private oblivious ram"
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "anonymous card shuffling and its applications to parallel mixnets"
    - "towards practical oblivious ram"
    - "randomized shellsort a simple oblivious sorting algorithm"

Connected through hyperedge HE-5 (induced by source paper "bios oram improved privacy preserving data access for parameterized outsourced storage"):
  with members:
    - "data oblivious graph algorithms in outsourced external memory"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "statistically secure oram with tilde o log 2 n overhead"
    - "oblivious ram simulation with efficient worst case access overhead"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-6 (induced by source paper "revisiting definitional foundations of oblivious ram for secure processor implementations"):
  with members:
    - "flat oram a simplified write only oblivious ram construction for secure processors"
    - "oblivious ram simulation with efficient worst case access overhead"
    - "towards practical oblivious ram"

Connected through hyperedge HE-7 (induced by source paper "cacheshuffle an oblivious shuffle algorithm using caches"):
  with members:
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "oblivious ram simulation with efficient worst case access overhead"

Connected through hyperedge HE-8 (induced by source paper "differentially private oblivious ram"):
  with members:
    - "sok cryptographically protected database search"
    - "differential privacy as a mutual information constraint"
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "differential privacy an economic method for choosing epsilon"
    - "towards practical oblivious ram"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "composition attacks and auxiliary information in data privacy"

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)