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: "a new approach to practical active secure two party computation"
  Abstract: We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction. #R##N#We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption (~34000 gates) takes 64 seconds, but when repeating the task 27 times it only takes less than 3 seconds per instance.

Connected through hyperedge HE-1 (induced by source paper "pd ml lite private distributed machine learning from lighweight cryptography"):
  with members:
    - "a flexible privacy preserving framework for singular value decomposition under internet of things environment"
    - "efficient hyperparameter optimization and infinitely many armed bandits"
    - "typicality based stability and privacy"
    - "hyperband a novel bandit based approach to hyperparameter optimization"
    - "fast differentially private matrix factorization"
    - "beyond worst case analysis in private singular vector computation"
    - "distributed learning communication complexity and privacy"
    - "on the complexity of nonnegative matrix factorization"

Connected through hyperedge HE-2 (induced by source paper "securely trading unverifiable information without trust"):
  with members:
    - "a scalable verification solution for blockchains"
    - "water from two rocks maximizing the mutual information"
    - "astraea a decentralized blockchain oracle"
    - "betrayal distrust and rationality smart counter collusion contracts for verifiable cloud computing"
    - "smart contract templates essential requirements and design options"
    - "informed truthfulness in multi task peer prediction"
    - "crowdsourced judgement elicitation with endogenous proficiency"

Connected through hyperedge HE-3 (induced by source paper "sharing information with competitors"):
  with members:
    - "how to incentivize data driven collaboration among competing parties"
    - "privacy aware mechanism design"
    - "rational secret sharing and multiparty computation extended abstract"

Connected through hyperedge HE-4 (induced by source paper "curie policy based secure data exchange"):
  with members:
    - "large scale distributed neural network training through online distillation"
    - "differentially private federated learning a client level perspective"
    - "achieving secure and differentially private computations in multiparty settings"
    - "a survey on homomorphic encryption schemes theory and implementation"
    - "federated multi task learning"
    - "inherit differential privacy in distributed setting multiparty randomized function computation"
    - "extending detection with forensic information"
    - "patient driven privacy control through generalized distillation"

Connected through hyperedge HE-5 (induced by source paper "fast actively secure ot extension for short secrets"):
  with members:
    - "backyard cuckoo hashing constant worst case operations with a succinct representation"

Connected through hyperedge HE-6 (induced by source paper "privacy preserving cross domain routing optimization a cryptographic approach"):
  with members:
    - "disco distributed multi domain sdn controllers"

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)