Privacy-Preserving Credit Scoring via Functional Encryption

The majority of financial organizations managing confidential data are aware of security threats and leverage widely accepted solutions (e.g., storage encryption, transport-level encryption, intrusion detection systems) to prevent or detect attacks. Yet these hardening measures do little to face even worse threats posed on data-in-use. Solutions such as Homomorphic Encryption (HE) and hardware-assisted Trusted Execution Environment (TEE) are nowadays among the preferred approaches for mitigating this type of threats. However, given the high-performance overhead of HE, financial institutions —whose processing rate requirements are stringent— are more oriented towards TEE-based solutions. The X-Margin Inc. company, for example, offers secure financial computations by combining the Intel SGX TEE technology and HE-based Zero-Knowledge Proofs, which shield customers’ data-in-use even against malicious insiders, i.e., users having privileged access to the system. Despite such a solution offers strong security guarantees, it is constrained by having to trust Intel and by the SGX hardware extension availability. In this paper, we evaluate a new frontier for X-Margin, i.e., performing privacy-preserving credit risk scoring via an emerging cryptographic scheme: Functional Encryption (FE), which allows a user to only learn a function of the encrypted data. We describe how the X-Margin application can benefit from this innovative approach and —most importantly— evaluate its performance impact.

[1]  S. Halevi,et al.  Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits , 2016, SIAM J. Comput..

[2]  David Pointcheval,et al.  Reading in the Dark: Classifying Encrypted Digits with Functional Encryption , 2018, IACR Cryptol. ePrint Arch..

[3]  Luigi Coppolino,et al.  VISE: Combining Intel SGX and Homomorphic Encryption for Cloud Industrial Control Systems , 2021, IEEE Transactions on Computers.

[4]  Brent Waters,et al.  Attribute-based encryption for fine-grained access control of encrypted data , 2006, CCS '06.

[5]  Melissa Chase,et al.  FAME: Fast Attribute-based Message Encryption , 2017, CCS.

[6]  Luigi Coppolino,et al.  Cloudifying Critical Applications: A Use Case from the Power Grid Domain , 2017, 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP).

[7]  Dario Fiore,et al.  Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings , 2018, IACR Cryptol. ePrint Arch..

[8]  Angelo De Caro,et al.  Simple Functional Encryption Schemes for Inner Products , 2015, IACR Cryptol. ePrint Arch..

[9]  Romain Gay,et al.  A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials , 2020, IACR Cryptol. ePrint Arch..

[10]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[11]  Brent Waters,et al.  Functional Encryption: Definitions and Challenges , 2011, TCC.

[12]  Dan Boneh,et al.  Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..

[13]  Carlos V. Rozas,et al.  Innovative instructions and software model for isolated execution , 2013, HASP '13.

[14]  Brent Waters,et al.  Attribute-Based Encryption for Circuits from Multilinear Maps , 2012, CRYPTO.