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: "a cca2 secure variant of the mceliece cryptosystem"
  Abstract: The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even tough McEliece PKC has a relatively big key size, encryption and decryption operations are rather efficient. In spite of all the recent results in coding theory based cryptosystems, to the date, there are no constructions secure against chosen ciphertext attacks in the standard model - the de facto security notion for public-key cryptosystems. In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model. Our construction is inspired by a recently proposed technique by Rosen and Segev.

Connected through hyperedge HE-1 (induced by source paper "provably secure group signature schemes from code based assumptions"):
  with members:
    - "post quantum cryptography code based signatures"
    - "a new zero knowledge code based identification scheme with reduced communication"

Connected through hyperedge HE-2 (induced by source paper "pkc pc a variant of the mceliece public key cryptosystem based on polar codes"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "universal bounds on the scaling behavior of polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-3 (induced by source paper "a framework for efficient adaptively secure composable oblivious transfer in the rom"):
  with members:
    - "commitment and oblivious transfer in the bounded storage model with errors"
    - "weakening the isolation assumption of tamper proof hardware tokens"
    - "noise tolerant learning the parity problem and the statistical query model"

Connected through hyperedge HE-4 (induced by source paper "enhanced public key security for the mceliece cryptosystem"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "an efficient cca2 secure variant of the mceliece cryptosystem in the standard model"
    - "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes"
    - "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes"
    - "error correcting pairs for a public key cryptosystem"
    - "on the decoding complexity of cyclic codes up to the bch bound"

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)