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 "improved veron identification and signature schemes in the rank metric"):
  Abstract: It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform. All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2. The resulting signature size is proportional to the number of rounds, thus making the 1/2 cheating probability version more attractive. We present a signature scheme based on double circulant codes in the rank metric, derived from an identification protocol with cheating probability of 2/3. We reduced this probability to 1/2 to obtain the smallest signature among signature schemes based on the Fiat-Shamir paradigm, around 22 KBytes for 128 bit security level. Furthermore, among all code-based signature schemes, our proposal has the lowest value of signature plus public key size, and the smallest secret and public key sizes. We provide a security proof in the Random Oracle Model, implementation performances, and a comparison with the parameters of the most important code-based signature schemes.

Includes members:
  Member "wave a new code based signature scheme":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ternary syndrome decoding with large weight")
  Member "ranksign an efficient signature algorithm based on the rank metric":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an algebraic attack on rank metric code based cryptosystems")
  Member "efficient encryption from random quasi cyclic codes":
    also connected through other hyperedges:
      (none)
  Member "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "a new algorithm for solving ring lpn with a reducible polynomial":
    also connected through other hyperedges:
      (none)
  Member "on the complexity of the rank syndrome decoding problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "a new zero knowledge code based identification scheme with reduced communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "provably secure group signature schemes from code based assumptions")
  Member "properties of codes in rank metric":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hamming and simplex codes for the sum rank metric")

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)