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 "distributed multi user secret sharing"):
  Abstract: A distributed secret sharing system is considered that consists of a dealer, $n$ storage nodes, and $m$ users. Each user is given access to a certain subset of storage nodes where it can download the data. The dealer wants to securely convey a specific secret $s_j$ to user $j$ via storage nodes, for $j=1,2,\dots,m$, in such a way that no user gets any information about other users' secrets in an information-theoretic sense. To this end, we propose to study protocols where the dealer encodes secrets into several secret shares and loads them into the storage nodes. Given a certain number of storage nodes we find the maximum number of users that can be served in such protocols and construct schemes that achieve this. We further define two major properties for such distributed secret sharing systems; communication complexity is defined as the total amount of data that needs to be downloaded by users in order to reconstruct their secrets; and storage overhead is defined as the total amount of data loaded by the dealer into the storage nodes normalized by the total size of secrets. The minimum possible communication complexity and a lower bound on storage overhead are characterized given any $n$ and $m$. Furthermore, we construct distributed secret sharing protocols, under certain conditions on the system parameters, that achieve the minimum communication complexity and attain the lower bound on the storage overhead thereby providing schemes that are optimal in terms of both the communication complexity and storage overhead. It is shown how to modify the proposed protocols in order to construct schemes for any set of parameters while providing a nearly optimal storage overhead.

Includes members:
  Member "communication efficient secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme")
  Member "staircase codes for secret sharing with optimal communication and read overheads":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme")
  Member "distributed secret dissemination across a network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "staircase codes for secret sharing with optimal communication and read overheads")

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)