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 "generic secure repair for distributed storage"):
  Abstract: This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into n shares, assigned to n nodes, so that any n − r nodes can decode the message but any colluding z nodes cannot infer any information about the message.  In  the  event  of  node  failures  so  that  shares  held  by  the  failed  nodes  are  lost,  the  system  needs  to  be  repaired  by#R##N#reconstructing and reassigning the lost shares to the failed (or replacement) nodes. This can be achieved trivially by a trustworthy third-party that receives the shares of the available nodes, recompute and reassign the lost shares. The interesting question, studied in the paper, is how to repair without a trustworthy third-party. The main issue that arises is repair security: how to maintain the#R##N#requirement that any colluding z nodes, including the failed nodes, cannot learn any information about the message, during and after the repair process? We solve this secure repair problem from the perspective of secure multi-party computation. Specifically, we design generic repair schemes that can securely repair any (scalar or vector) linear secret sharing schemes. We prove a lower bound on the repair bandwidth of secure repair schemes and show that the proposed secure repair schemes achieve the optimal#R##N#repair bandwidth up to a small constant factor when#R##N#n dominates z, or when the secret sharing scheme being repaired has optimal rate.  We  adopt  a  formal  information-theoretic  approach  in  our  analysis  and  bounds.  A  main  idea  in  our  schemes  is  to  allow  a more  flexible  repair  model  than  the  straightforward  one-round  repair  model  implicitly  assumed  by  existing  secure  regenerating codes. Particularly, the proposed secure repair schemes are simple and efficient two-round protocols.

Includes members:
  Member "toward optimal secure distributed storage systems with exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of secure distributed matrix multiplication")
  Member "on secrecy capacity of minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "weakly secure regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low complexity secure code lcsc design for big data in cloud storage systems")
  Member "secure cooperative regenerating codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "security concerns in minimum storage cooperative regenerating codes")
  Member "information theoretically secure regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private and rateless adaptive coded matrix vector multiplication")

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)