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: "strongly secure ramp secret sharing schemes for general access structures"
  Abstract: Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret leaks from a non-qualified set of shares, and hence, they are more desirable than weak ramp SS schemes. However, it is not known how to construct the strong ramp SS schemes in the case of general access structures. In this paper, it is shown that a strong ramp SS scheme can always be constructed from a SS scheme with plural secrets for any feasible general access structure. As a byproduct, it is pointed out that threshold ramp SS schemes based on Shamir's polynomial interpolation method are {\em not} always strong.

Connected through hyperedge HE-1 (induced by source paper "on asymptotically good ramp secret sharing schemes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "squares of random linear codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new asymptotic metrics for relative generalized hamming weight"

Connected through hyperedge HE-2 (induced by source paper "secret sharing for cloud data security a survey"):
  with members:
    - "security and privacy aspects in mapreduce on clouds a survey"
    - "a novel multi secret sharing approach for secure data warehousing and on line analysis processing in the cloud"
    - "fvss a new secure and cost efficient scheme for cloud data warehouses"
    - "an efficient multi use multi secret sharing scheme based on hash function"

Connected through hyperedge HE-3 (induced by source paper "detecting algebraic manipulation in leaky storage systems"):
  with members:
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-4 (induced by source paper "relative generalized hamming weights of one point algebraic geometric codes"):
  with members:
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "feng rao decoding of primary codes"
    - "an improvement of the feng rao bound for primary codes"
    - "further improvements on the feng rao bound for dual codes"
    - "on the order bounds for one point ag codes"
    - "mds codes on the erasure erasure wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "secure erasure codes with partial decodability"):
  with members:
    - "weakly secure regenerating codes for distributed storage"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "mds codes on the erasure erasure wiretap channel"

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)