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 "the melbourne shuffle improving oblivious storage in the cloud"):
  Abstract: We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for network-based outsourcing of data.

Includes members:
  Member "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sanns scaling up secure approximate k nearest neighbors search")
  Member "anonymous card shuffling and its applications to parallel mixnets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mix oram using delegate shuffles")
  Member "oblivious ram simulation with efficient worst case access overhead":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (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-6 (induced by source paper "lower bounds for oblivious near neighbor search")
  Member "randomized shellsort a simple oblivious sorting algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pushing the limits of encrypted databases with secure hardware")

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)