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 "interactive secure function computation"):
  Abstract: We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings.

Includes members:
  Member "robust privacy utility tradeoffs under differential privacy and hamming distortion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tunable measures for information leakage and applications to privacy utility tradeoffs")
  Member "communication rounds tradeoffs for common randomness and secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "round complexity of common randomness generation the amortized setting")
  Member "secret key agreement under discussion rate constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "communication and randomness lower bounds for secure computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "information complexity density and simulation of protocols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secure multiterminal source coding with side information at the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")

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)