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 "strong security and separated code constructions for the broadcast channels with confidential messages"):
  Abstract: AbstractThe strong security criterion in the information theoretic security re-quires the mutual information between the secret information and the eaves-dropped information converges to zero as the code length goes to the inﬁnity,even when the mutual information is not divided by the code length, whilethe weak security criterion requires only the mutual information divided bythe code length converges to zero. The capacity region of the broadcastchannels with conﬁdential messages remains unknown when th e strong se-curity is required. We prove that the capacity region under the strong secu-rity criterion is the same as that under the weak one. Our proof techniqueattaches inverses of hash functions to a random coding argument for thebroadcast channel with degraded message sets, whose analysis on the de-coding error probability is carried over to our proof without change. Thus,our proof technique separates the analysis of secrecy from that of decod-ing error probability, and an advance in the upper bound on the decodingerror probability over the broadcast channels with degraded message setsautomatically also advances the decoding probability analysis of our prooftechnique.

Includes members:
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey")
  Member "construction of wiretap codes from ordinary channel codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)