Decentralized multi-client functional encryption for set intersection with improved efficiency
Author:
Open Access
- 29 October 2022
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (3) , 1053-1093
Abstract
Functional encryption (FE) is a new paradigm of public key encryption that can control the exposed information of plaintexts by supporting computation on encrypted data. In this paper, we propose efficient multi-client FE (MCFE) schemes that compute the set intersection of ciphertexts generated by two clients. First, we propose an MCFE scheme that calculates the set intersection cardinality (MCFE-SIC) and prove its static security under dynamic assumptions. Next, we extend our MCFE-SIC scheme to an MCFE scheme for set intersection (MCFE-SI) and prove its static security under dynamic assumptions. The decryption algorithm of our MCFE-SI scheme is more efficient than the existing MCFE-SI scheme because it requires fewer pairing operations to calculate the intersection of two clients. Finally, we propose a decentralized MCFE scheme for set intersection (DMCFE-SI) that decentralizes the generation of function keys. Our MCFE schemes can be effectively applied to a privacy-preserving contact tracing system to prevent the spread of recent infectious diseases.Keywords
Funding Information
- Institute of Information & Communications Technology Planning & Evaluation (2021-0-00518)
This publication has 28 references indexed in Scilit:
- Multi-input Functional Encryption2014
- Charm: a framework for rapidly prototyping cryptosystemsJournal of Cryptographic Engineering, 2013
- Functional Encryption with Bounded Collusions via Multi-party Computation2012
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups2010
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products2008
- Fuzzy Identity-Based Encryption2005
- Hierarchical Identity Based Encryption with Constant Size Ciphertext2005
- Efficient Private Matching and Set Intersection2004
- Identity-Based Encryption from the Weil Pairing2001
- Lower Bounds for Discrete Logarithms and Related Problems1997