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 "seqoram a locality preserving write only oblivious ram"):
  Abstract: Oblivious RAM technology has advanced rapidly. Under certain client- side storage assumptions, tree-based ORAM designs have achieved established lower bounds even for online adversaries that can monitor everything a client does. Write-only ORAMs target a weaker but often more practical multi- snapshot adversary that can monitor only user writes. This adversary is typical in plausible deniability and censorship-resilient systems. But, although existing write-only ORAMs achieve significantly better theoretical performance than traditional ORAMs, these gains do not materialize when deployed on real systems. This happens primarily due to the random data placement strategies used to break correlations between logical and physical namespaces - thus ensuring write "unlinkability". Random access performs poorly on both rotational disks and SSDs, often increasing wear significantly, and interfering with wear-leveling mechanisms. In this work, we show how to achieve write "unlinkability" without random data access. SeqORAM is a new locality-preserving write-only ORAM. Data blocks close to each other in the logical domain land also in close proximity on disk. A full-fledged Linux kernel-level implementation of SeqORAM is 100x faster than the state-of-the-art for standard workloads.

Includes members:
  Member "deterministic stash free write only oram":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sqoram read optimized sequential write only oblivious ram")
  Member "oblivisync practical oblivious file backup and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sqoram read optimized sequential write only oblivious ram")
  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")

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)