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: "homomorphic public key cryptosystems and encrypting boolean circuits"
  Abstract: In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over an appropriate finitely generated group.

Connected through hyperedge HE-1 (induced by source paper "a survey on homomorphic encryption schemes theory and implementation"):
  with members:
    - "reuse it or lose it more efficient secure computation through reuse of encrypted values"
    - "a practical secure and verifiable cloud computing for mobile systems"
    - "homomorphic encryption theory and application"

Connected through hyperedge HE-2 (induced by source paper "cryptography with right angled artin groups"):
  with members:
    - "the status of polycyclic group based cryptography a survey and open problems"
    - "using semidirect product of semi groups in public key cryptography"
    - "graph isomorphism in quasipolynomial time"
    - "a secret sharing scheme based on group presentations and the word problem"

Connected through hyperedge HE-3 (induced by source paper "homomorphic encryption theory and application"):
  with members:
    - "security in wireless sensor networks"
    - "security and privacy issues in wireless mesh networks a survey"
    - "an attack on privacy preserving data aggregation protocol for wireless sensor networks"
    - "secure and privacy preserving data aggregation protocols for wireless sensor networks"
    - "secure and privacy preserving authentication protocols for wireless mesh networks"
    - "a novel mechanism for detection of distributed denial of service attacks"
    - "a mechanism for detection of gray hole attack in mobile ad hoc networks"
    - "reputation and trust based systems for wireless self organizing networks"

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)