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: "oblivious query processing"
  Abstract: Motivated by cloud security concerns, there is an increasing interest in database systems that can store and support queries over encrypted data. A common architecture for such systems is to use a trusted component such as a cryptographic co-processor for query processing that is used to securely decrypt data and perform computations in plaintext. The trusted component has limited memory, so most of the (input and intermediate) data is kept encrypted in an untrusted storage and moved to the trusted component on ``demand.'' #R##N#In this setting, even with strong encryption, the data access pattern from untrusted storage has the potential to reveal sensitive information; indeed, all existing systems that use a trusted component for query processing over encrypted data have this vulnerability. In this paper, we undertake the first formal study of secure query processing, where an adversary having full knowledge of the query (text) and observing the query execution learns nothing about the underlying database other than the result size of the query on the database. We introduce a simpler notion, oblivious query processing, and show formally that a query admits secure query processing iff it admits oblivious query processing. We present oblivious query processing algorithms for a rich class of database queries involving selections, joins, grouping and aggregation. For queries not handled by our algorithms, we provide some initial evidence that designing oblivious (and therefore secure) algorithms would be hard via reductions from two simple, well-studied problems that are generally believed to be hard. Our study of oblivious query processing also reveals interesting connections to database join theory.

Connected through hyperedge HE-1 (induced by source paper "encdbdb searchable encrypted fast compressed in memory database using enclaves"):
  with members:
    - "an efficiently searchable encrypted data structure for range queries"
    - "stealthdb a scalable encrypted database with full sql query support"
    - "software grand exposure sgx cache attacks are practical"
    - "hardidx practical and secure index with sgx"
    - "zerodb white paper"

Connected through hyperedge HE-2 (induced by source paper "kloakdb a platform for analyzing sensitive data with k anonymous query processing"):
  with members:
    - "shrinkwrap differentially private query processing in private data federations"
    - "smcql secure querying for federated databases"
    - "inferring fine grained control flow inside sgx enclaves with branch shadowing"
    - "worst case background knowledge for privacy preserving data publishing"

Connected through hyperedge HE-3 (induced by source paper "exploiting data sensitivity on partitioned data"):
  with members:
    - "partitioned data security on outsourced sensitive and non sensitive data"
    - "security and privacy aspects in mapreduce on clouds a survey"

Connected through hyperedge HE-4 (induced by source paper "pushing the limits of encrypted databases with secure hardware"):
  with members:
    - "randomized shellsort a simple oblivious sorting algorithm"

Connected through hyperedge HE-5 (induced by source paper "oblidb oblivious query processing for secure databases"):
  with members:
    - "sgxpectre stealing intel secrets from sgx enclaves via speculative execution"
    - "obladi oblivious serializable transactions in the cloud"
    - "the pyramid scheme oblivious ram for trusted processors"
    - "stealthdb a scalable encrypted database with full sql query support"
    - "software grand exposure sgx cache attacks are practical"
    - "prochlo strong privacy for analytics in the crowd"
    - "sok cryptographically protected database search"
    - "hardidx practical and secure index with sgx"

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.DB(Databases)