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 "secret key based identification and authentication with a privacy constraint"):
  Abstract: We consider the problem of identification and authentication based on secret key generation from some user-generated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as authenticate them based on the estimated secret key while preserving the privacy of the enrolled data and of the generated keys. We characterize the optimal tradeoff between the identification rate, the compression rate of the users' source data, information leakage rate, and secret key rate. In particular, we provide a coding strategy based on layered random binning which is shown to be optimal. In addition, we study a related secure identification/authentication problem where an adversary tries to deceive the system using its own data. Here the optimal tradeoff between the identification rate, compression rate, leakage rate, and exponent of the maximum false acceptance probability is provided. The results reveal a close connection between the optimal secret key rate and the false acceptance exponent of the identification/authentication system.

Includes members:
  Member "secret key based authentication with a privacy constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "controllable identifier measurements for private authentication with secret keys")
  Member "lossy source coding with reconstruction privacy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lossy compression with privacy constraints optimality of polar codes")
  Member "secure multiterminal source coding with side information at the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "secure biometrics concepts authentication architectures and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "controllable identifier measurements for private authentication with secret keys")
  Member "fuzzy extractors how to generate strong keys from biometrics and other noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "authentication with distortion criteria":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secret key based authentication with a privacy constraint")

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)