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: "revisiting definitional foundations of oblivious ram for secure processor implementations"
  Abstract: Oblivious RAM (ORAM) is a renowned technique to hide the access patterns of an application to an untrusted memory. According to the standard ORAM definition presented by Goldreich and Ostrovsky, in order for two ORAM access sequences to be computationally indistinguishable, the lengths of these sequences must be identically distributed. An artifact of this definition is that it does not apply to modern ORAM implementations adapted in current secure processors technology because of their arbitrary lengths of memory access sequences depending on programs' behaviors. As a result, the ORAM timing and termination channels are not catered for in the theoretical foundations of ORAM. #R##N#This paper conducts a first rigorous study of the standard ORAM definition in view of modern practical ORAMs (e.g., Path ORAM) and demonstrates the gap between theoretical foundations and real implementations. A formal ORAM definition which allows arbitrary lengths of ORAM sequences, hence incorporating timing/termination channel leakage, has been proposed. It has been shown how this definition is much broader than the standard ORAM definition and better fits the modern practical ORAM implementations. The proposed definition relaxes the constraints around the stash size and overflow probability for Path ORAM, and essentially transforms its security argument into a performance consideration problem. Finally, to mitigate internal side channel leakages, a generic framework for dynamic resource partitioning has been proposed to achieve a balance between performance and leakage via contention on shared resources.

Connected through hyperedge HE-1 (induced by source paper "stronger lower bounds for online oram"):
  with members:
    - "spectre attacks exploiting speculative execution"
    - "lower bounds for oblivious data structures"
    - "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"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-2 (induced by source paper "flat oram a simplified write only oblivious ram construction for secure processors"):
  with members:
    - "connecting the dots privacy leakage via write access patterns to the main memory"
    - "deterministic stash free write only oram"
    - "oblivious ram simulation with efficient worst case access overhead"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "towards practical oblivious ram"

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)