human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "Authenticating Computation on Groups: New Homomorphic Primitives and Applications"):
  with members:
    - "Structure-preserving signatures and commitments to group elements"
    - "Signing on Elements in Bilinear Groups for Modular Protocol Design."

Connected through hyperedge HE-2 (induced by source paper "Efficient Secure and Verifiable Outsourcing of Matrix Multiplications"):
  with members:
    (none)

Connected through hyperedge HE-3 (induced by source paper "Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries"):
  with members:
    - "Cryptography and game theory: designing protocols for exchanging information"
    - "Non-Interactive Secure Computation Based on Cut-and-Choose"

Connected through hyperedge HE-4 (induced by source paper "Graph-Induced Multilinear Maps from Lattices"):
  with members:
    - "Collusion resistant broadcast encryption with short ciphertexts and private keys"
    - "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits"

Connected through hyperedge HE-5 (induced by source paper "Non-Interactive Secure Computation Based on Cut-and-Choose"):
  with members:
    - "Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries"

Connected through hyperedge HE-6 (induced by source paper "A Secure Obfuscator for Encrypted Blind Signature Functionality"):
  with members:
    - "Secure obfuscation for encrypted signatures"
    - "On strong simulation and composable point obfuscation"

Connected through hyperedge HE-7 (induced by source paper "On Obfuscation with Random Oracles"):
  with members:
    - "Program obfuscation with leaky hardware"
    - "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science