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 "converses for secret key agreement and secure computing"):
  Abstract: We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the secret key length, which is derived using a reduction of binary hypothesis testing to multiparty secret key agreement. Building on this basic result, we derive new converses for multiparty secret key agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to secret key agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

Includes members:
  Member "secret key capacity for multipleaccess channel with public feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey")
  Member "interactive communication for data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "second order region for gray wyner network")
  Member "information complexity density and simulation of protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secret key agreement general capacity and second order asymptotics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "assisted common information with an application to secure two party sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "a new upperbound for the oblivious transfer capacity of discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for interactive function computation via wyner common information")
  Member "strong converse for a degraded wiretap channel via active hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "on the efficiency of classical and quantum secure function evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multipartite monotones for secure sampling by public discussion from noisy correlations")

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)