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 "a model for adversarial wiretap channel"):
  Abstract: In wiretap model of secure communication the goal is to provide (asymptotic) perfect secrecy and reliable communication over a noisy channel that is eavesdropped by an adversary with unlimited computational power. This goal is achieved by taking advantage of the channel noise and without requiring a shared key. The model has attracted attention in recent years because it captures eavesdropping attack in wireless communication. The wiretap adversary is a passive eavesdropping adversary at the physical layer of communication. In this paper we propose a model for adversarial wiretap (AWTP) channel that models active adversaries at this layer. We consider a $(\rho_r, \rho_w)$ wiretap adversary who can see a fraction $\rho_r$, and modify a fraction $\rho_w$, of the sent codeword. The code components that are read and/or modified can be chosen adaptively, and the subsets of read and modified components in general, can be different. AWTP codes provide secrecy and reliability for communication over these channels. We give security and reliability definitions and measures for these codes, and define secrecy capacity of an AWTP channel that represents the secrecy potential of the channel. The paper has two main contributions. First, we prove a tight upper bound on the rate of AWTP codes with perfect secrecy for $(\rho_r, \rho_w)$-AWTP channels, and use the bound to derive the secrecy capacity of the channel. We prove a similar bound for $\epsilon$-secure codes also, but in this case the bound is not tight. Second, we give an explicit construction for a capacity achieving AWTP code family, and prove its security and efficiency properties. We show that AWTP model is a natural generalization of Wyner's wiretap models and somewhat surprisingly, also provides a direct generalization for a seemingly unrelated cryptographic primitive, Secure Message Transmission (SMT).

Includes members:
  Member "capacity results for arbitrarily varying wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "invertible extractors and wiretap protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models")

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)