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: "Efficient Non-malleable Commitment Schemes"
  Abstract: We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log parameters generated by a trusted party. Our protocols require only three rounds and a few modular exponentiations. We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor and the one given by Di Crescenzo, Ishai and Ostrovsky.

Connected through hyperedge HE-1 (induced by source paper "Non-interactive and reusable non-malleable commitment schemes"):
  with members:
    - "A unified framework for UC from only OT"
    - "New constructions of efficient simulation-sound commitments using encryption and their applications"

Connected through hyperedge HE-2 (induced by source paper "Fast generation of prime numbers and secure public-key cryptographic parameters"):
  with members:
    - "Fast Generation of Provable Primes Using Search in Arithmetic Progressions"
    - "A novel ID-based group signature"

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