human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "More Efficient Constant-Round Multi-party Computation from BMR and SHE"):
  Abstract: We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry's Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al. CRYPTO 2015. Our protocol avoids various inefficiencies of the previous two protocols. Compared to Gentry's protocol we only require Somewhat Homomorphic Encryption SHE. Whilst in comparison to the SPDZ-BMR protocol we require only a quadratic complexity in the number of players as opposed to cubic, we have fewer rounds, and we require less proofs of correctness of ciphertexts. Additionally, we present a variant of our protocol which trades the depth of the garbling circuit computed using SHE for some more multiplications in the offline and online phases.

Includes members:
  Member "Authenticating Computation on Groups: New Homomorphic Primitives and Applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "Structure-preserving signatures and commitments to group elements")
  Member "A Secure Obfuscator for Encrypted Blind Signature Functionality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "On strong simulation and composable point obfuscation")
  Member "On Obfuscation with Random Oracles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits")
  Member "Graph-Induced Multilinear Maps from Lattices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits")
  Member "Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "Cryptography and game theory: designing protocols for exchanging information")
  Member "Non-Interactive Secure Computation Based on Cut-and-Choose":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries")
  Member "Efficient Secure and Verifiable Outsourcing of Matrix Multiplications":
    also connected through other hyperedges:
      (none)
  Member "Rational Secure Two-party Computation in Social Cloud":
    also connected through other hyperedges:
      (none)

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science