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: "A Secure Obfuscator for Encrypted Blind Signature Functionality"
  Abstract: This paper introduces a new obfuscation called obfuscation of encrypted blind signature. Informally, Alice is Signer and Bob is Recipient. Bob needs Alice to sign a message, but he does not want Alice to know what the message is. Furthermore, Bob doesn’t want anyone to know the interactive process. So we present a secure obfuscator for encrypted blind signature which makes the interactions process unintelligible for any third party, while still keeps the original functionality of encrypted blind signature. We use schnorr’s blind signature scheme and linear encryption scheme as blocks to construct a new obfuscator. Moreover, we propose two new security definitions: blindness w.r.t encrypted blind signature (EBS) obfuscator and one-more unforgeability(OMU) w.r.t EBS obfuscator, and prove them under Decisional Linear (DL) assumption and the hardness of discrete logarithm, respectively. We also demonstrate that our obfuscator satisfies the Average-Case Virtual Black-Box Property(ACVBP) w.r.t dependent oracle, it is indistinguishable secure. Our paper expands a new direction for the application of obfuscation.

Connected through hyperedge HE-1 (induced by source paper "On strong simulation and composable point obfuscation"):
  with members:
    - "Secure obfuscation for encrypted signatures"
    - "Program obfuscation with leaky hardware"

Connected through hyperedge HE-2 (induced by source paper "Secure obfuscation for encrypted signatures"):
  with members:
    - "Efficient Construction of (Distributed) Verifiable Random Functions"
    - "On strong simulation and composable point obfuscation"

Connected through hyperedge HE-3 (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"
    - "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"
    - "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