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 "group secret key generation using algebraic rings in wireless networks"):
  Abstract: In physical-layer Group Secret-Key (GSK) generation, multiple nodes of a wireless network synthesize symmetric keys by observing a subset of their channels, referred as the common source of randomness (CSR). Unlike two-user key generation, in GSK generation, some nodes must act as \emph{facilitators} by broadcasting quantized versions of the linear combinations of the channel realizations, which in turn reduces the overall key-rate, and also incurs non-zero leakage of the CSR to an eavesdropper. Identifying these issues, we propose a practical GSK generation protocol, referred to as Algebraic Symmetrically Quantized GSK (A-SQGSK) protocol, in a network of three nodes, wherein due to quantization of symbols at the facilitator, the other two nodes also quantize their channel realizations, and use them appropriately over algebraic rings to generate the keys. First, we prove that the A-SQGSK protocol incurs zero leakage. Subsequently, on the CSR provided by the A-SQGSK protocol, we propose a consensus algorithm among the three nodes, called the Entropy-Maximization Error-Minimization (EM-EM) algorithm, which maximizes the entropy of the secret-key subject to an upper-bound on the mismatch-rate. We use extensive analysis and simulation results to lay out guidelines to jointly choose the parameters of the A-SQGSK protocol and the EM-EM algorithm.

Includes members:
  Member "insider attacks on physical layer group secret key generation in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks")
  Member "secret key generation from gaussian sources using lattice hashing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks")
  Member "exploiting channel diversity in secret key generation from multipath fading randomness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design and implementation of secret key agreement for platoon based vehicular cyber physical systems")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covert secret key generation with an active warden")
  Member "group secret key generation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "part i improving computational efficiency of communication for omniscience")

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.IT(Information Theory)