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: "Non-Interactive Secure Computation Based on Cut-and-Choose"
  Abstract: In recent years, secure two-party computation (2PC) has been demonstrated to be feasible in practice. However, all efficient general-computation 2PC protocols require multiple rounds of interaction between the two players. This property restricts 2PC to be only relevant to scenarios where both players can be simultaneously online, and where communication latency is not an issue.

Connected through hyperedge HE-1 (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"
    - "More Efficient Constant-Round Multi-party Computation from BMR and SHE"

Connected through hyperedge HE-2 (induced by source paper "More Efficient Constant-Round Multi-party Computation from BMR and SHE"):
  with members:
    - "Authenticating Computation on Groups: New Homomorphic Primitives and Applications"
    - "A Secure Obfuscator for Encrypted Blind Signature Functionality"
    - "On Obfuscation with Random Oracles"
    - "Graph-Induced Multilinear Maps from Lattices"
    - "Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries"
    - "Efficient Secure and Verifiable Outsourcing of Matrix Multiplications"
    - "Rational Secure Two-party Computation in Social Cloud"
    - "An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle"

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