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: "information theoretic security without an honest majority"
  Abstract: We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either computational assumptions or of an honest majority.

Connected through hyperedge HE-1 (induced by source paper "prio private robust and scalable computation of aggregate statistics"):
  with members:
    - "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation"
    - "building a rappor with the unknown privacy preserving learning of associations and data dictionaries"
    - "riposte an anonymous messaging system handling millions of users"
    - "efficient private statistics with succinct sketches"
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "hang with your buddies to resist intersection attacks"
    - "proactively accountable anonymous messaging in verdict"
    - "verifying computations with streaming interactive proofs"

Connected through hyperedge HE-2 (induced by source paper "disjoint difference families and their applications"):
  with members:
    - "non overlapping codes"
    - "new families of optimal frequency hopping sequence sets"
    - "a combinatorial model of interference in frequency hopping schemes"
    - "high rate self synchronizing codes"
    - "information theoretic authentication and secrecy codes in the splitting model"
    - "combinatorial bounds and characterizations of splitting authentication codes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "optimal rate code constructions for computationally simple channels"

Connected through hyperedge HE-3 (induced by source paper "exact efficient and information theoretically secure voting with an arbitrary number of cheaters"):
  with members:
    - "information theoretically secure voting without an honest majority"

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)