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: "Physical Zero-Knowledge Proofs of Physical Properties"
  Abstract: Is it possible to prove that two DNA-fingerprints match, or that they do not match, without revealing any further information about the fingerprints? Is it possible to prove that two objects have the same design without revealing the design itself? In the digital domain, zero-knowledge is an established concept where a prover convinces a verifier of a statement without revealing any information beyond the statement’s validity. However, zero-knowledge is not as well-developed in the context of problems that are inherently physical. In this paper, we are interested in protocols that prove physical properties of physical objects without revealing further information. The literature lacks a unified formal framework for designing and analyzing such protocols. We suggest the first paradigm for formally defining, modeling, and analyzing physical zero-knowledge (PhysicalZK) protocols, using the Universal Composability framework. We also demonstrate applications of physical zero-knowledge to DNA profiling and neutron radiography. Finally, we explore public observation proofs, an analog of public-coin proofs in the context of PhysicalZK.

Connected through hyperedge HE-1 (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"
    - "Non-Interactive Secure Computation Based on Cut-and-Choose"
    - "Efficient Secure and Verifiable Outsourcing of Matrix Multiplications"
    - "Rational Secure Two-party Computation in Social Cloud"

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