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: "non malleable extractors two source extractors and privacy amplification"
  Abstract: Dodis and Wichs introduced the notion of a non-malleable extractor to study the problem of privacy amplification with an active adversary. A non-malleable extractor is a much stronger version of a strong extractor. Previously, there are only two known constructions of non-malleable extractors. Both constructions only work for (n, k)-sources with k>n/2. Interestingly, both constructions are also two-source extractors. #R##N#In this paper, we present a strong connection between non-malleable extractors and two-source extractors. The first part of the connection shows that non-malleable extractors can be used to construct two-source extractors. With appropriate parameters the resulted two-source extractor beats the best known construction of two-source extractors. This partially explains why previous constructions of non-malleable extractors only work for sources with entropy rate >1/2, and why explicit non-malleable extractors for small min-entropy may be hard to get. The second part of the connection shows that certain two-source extractors can be used to construct non-malleable extractors. Using this connection, we obtain the first construction of non-malleable extractors for k  0, and a conditional (semi-explicit) construction that can potentially achieve k=\alpha n for any constant \alpha>0. #R##N#Finally, despite the lack of explicit non-malleable extractors for arbitrarily linear entropy, we give the first 2-round privacy amplification protocol with asymptotically optimal entropy loss and communication complexity for (n, k) sources with k=\alpha n for any constant \alpha>0. This dramatically improves previous results and answers an open problem in \cite{DLWZ11}.

Connected through hyperedge HE-1 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models"):
  with members:
    - "secret sharing with binary shares"
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "repairing reed solomon codes"
    - "non malleable extractors and codes with their many tampered extensions"
    - "non malleable coding against bit wise and split state tampering"
    - "optimal rate code constructions for computationally simple channels"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-2 (induced by source paper "non malleable codes for small depth circuits"):
  with members:
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "non malleable extractors and codes with their many tampered extensions"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-3 (induced by source paper "improved non malleable extractors non malleable codes and independent source extractors"):
  with members:
    - "explicit non malleable extractors multi source extractors and almost optimal privacy amplification protocols"
    - "explicit resilient functions matching ajtai linial"
    - "non malleable extractors and codes with their many tampered extensions"
    - "three source extractors for polylogarithmic min entropy"
    - "non malleable coding against bit wise and split state tampering"
    - "capacity of non malleable codes"
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-4 (induced by source paper "explicit non malleable extractors multi source extractors and almost optimal privacy amplification protocols"):
  with members:
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "explicit resilient functions matching ajtai linial"
    - "non malleable extractors and codes with their many tampered extensions"
    - "three source extractors for polylogarithmic min entropy"
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"
    - "bounded independence fools halfspaces"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-5 (induced by source paper "non malleable extractors and codes with their many tampered extensions"):
  with members:
    - "three source extractors for polylogarithmic min entropy"
    - "non malleable coding against bit wise and split state tampering"
    - "capacity of non malleable codes"
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"
    - "non malleable codes from the wire tap channel"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-6 (induced by source paper "three source extractors for polylogarithmic min entropy"):
  with members:
    - "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"

Connected through hyperedge HE-7 (induced by source paper "non malleable coding against bit wise and split state tampering"):
  with members:
    - "non malleable extractors and codes with their many tampered extensions"
    - "capacity of non malleable codes"
    - "privacy amplification and non malleable extractors via character sums"
    - "applications of derandomization theory in coding"

Connected through hyperedge HE-8 (induced by source paper "non malleable condensers for arbitrary min entropy and almost optimal protocols for privacy amplification"):
  with members:
    - "privacy amplification and non malleable extractors via character sums"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

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)