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: "commitment capacity of discrete memoryless channels"
  Abstract: In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bidirectional side communication is allowed. #R##N#By a well-known reduction, this result provides a lower bound on the channel's capacity for implementing coin tossing, which we conjecture to be an equality. #R##N#The method of proving this relates the problem to Wyner's wire--tap channel in an amusing way. We also discuss extensions to quantum channels.

Connected through hyperedge HE-1 (induced by source paper "on the commitment capacity of unfair noisy channels"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "secrecy capacity region of fading broadcast channels"
    - "secrecy capacity of the wiretap channel with noisy feedback"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "secure list decoding"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-3 (induced by source paper "oblivious transfer over wireless channels"):
  with members:
    - "the oblivious transfer capacity of the wiretapped binary erasure channel"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "mimo precoding with x and y codes"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "commitment and oblivious transfer in the bounded storage model with errors"):
  with members:
    - "a framework for efficient adaptively secure composable oblivious transfer in the rom"
    - "on the oblivious transfer capacity of generalized erasure channels against malicious adversaries"

Connected through hyperedge HE-5 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "the complexity of estimating r enyi entropy"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "converses for secret key agreement and secure computing"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "interactive communication for data exchange"
    - "information complexity density and simulation of protocols"
    - "secret key agreement general capacity and second order asymptotics"
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "on the efficiency of classical and quantum secure function evaluation"

Connected through hyperedge HE-8 (induced by source paper "on the efficiency of classical and quantum secure function evaluation"):
  with members:
    - "assisted common information further results"
    - "oblivious transfer amplification"

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)