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 "on the commitment capacity of unfair noisy channels"):
  Abstract: Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damgard et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious transfer protocols. Given that noisy channels are a precious resource for cryptographic purposes, one important question is determining the optimal rate in which they can be used. The commitment capacity has already been determined for the cases of discrete memoryless channels and Gaussian channels. In this work we address the problem of determining the commitment capacity of unfair noisy channels. We compute a single-letter characterization of the commitment capacity of unfair noisy channels. In the case where an adversary has no control over the channel (the fair case) our capacity reduces to the well-known capacity of a discrete memoryless binary symmetric channel.

Includes members:
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "fuzzy extractors how to generate strong keys from biometrics and other noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "secrecy capacity region of fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "secrecy capacity of the wiretap channel with noisy feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy capacity of colored gaussian noise channels with feedback")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "commitment capacity of discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure list decoding")

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)