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 "a general multi party protocol for minimal communication and local computation"):
  Abstract: A client wishes to outsource computation on confidential data to a network of servers. He does not trust a server on its own, but believes that servers do not collude. To solve this problem we introduce a new scheme called \emph{JOS} for perfect security in the context of secure multiparty computation in the semi-honest model that naturally requires at least three parties. It differs from classical work such as Yao, GMW, BGW or GRR through an explicit distinction of keys and encrypted values rather than having (equal) shares of a secret. Furthermore, JOS makes use of the distributive and associative nature of its encryption schemes and, at times, "double" encrypts values. Any Boolean circuit $C$ in disjunctive normal form with $w$ variables per clause can be evaluated in O($\log k$) rounds using messages of size O($2^{w-k}$) for an arbitrary parameter $k \in [2,w]$ and O($|C|\cdot 2^{w-k}$) bit operations. We allow for collusion of up to $n-2$ parties. On the theoretical side JOS improves a large body of work in one or several metrics. On the practical side, our local computation requirements improve on the run-time of GRR using Shamir's secret sharing up to several orders of magnitude.

Includes members:
  Member "secure numerical and logical multi party operations":
    also connected through other hyperedges:
      (none)
  Member "secure arithmetic computation with no honest majority":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cryptographically blinded games leveraging players limitations for equilibria and profit")

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.CR(Cryptography and Security)