human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "oblivious transfer amplification"
  Abstract: Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions oblivious transfer can be based on. #R##N#The results in our thesis are threefold. First, we present a protocol that implements oblivious transfer from a weakened oblivious transfer called universal oblivious transfer, where one of the two players may get additional information. Our reduction is about twice as efficient as previous results. #R##N#Weak oblivious transfer is an even weaker form of oblivious transfer, where both players may obtain additional information about the other player's input, and where the output can contain errors. We give a new, weaker definition of weak oblivious transfer, as well as new reductions with a more detailed analysis. #R##N#Finally, we carry over our results to the computational setting and show how a weak oblivious transfer that is sometimes incorrect and only mildly secure against computationally bounded adversaries can be strengthened.

Connected through hyperedge HE-1 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis"):
  with members:
    - "secret key agreement general capacity and second order asymptotics"
    - "polar coding for secret key generation"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "on the randomness of independent experiments"

Connected through hyperedge HE-2 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach"):
  with members:
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "the capacity region of the source type model for secret key and private key generation"
    - "polar coding for secret key generation"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "a game theoretic view of the interference channel impact of coordination and bargaining"
    - "a constrained evolutionary gaussian multiple access channel game"
    - "secret key and private key constructions for simple multiterminal source models"
    - "shannon meets nash on the interference channel"

Connected through hyperedge HE-3 (induced by source paper "on the efficiency of classical and quantum secure function evaluation"):
  with members:
    - "assisted common information further results"
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "leakage resilient cryptography with key derived from sensitive data"):
  with members:
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-5 (induced by source paper "assisted common information further results"):
  with members:
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "assisted common information with applications to secure two party computation"):
  with members:
    - "commitment capacity of discrete memoryless channels"

Question: Please tell me which class the center node 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)