Decentralized multi-client functional encryption for set intersection with improved efficiency
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, the authors propose efficient multi-client FE (MCFE) schemes, that compute the set intersection of ciphertexts generated by two clients. First, they propose an MCFE scheme that calculates the set intersection cardinality (MCFE-SIC) and prove its static security under dynamic assumptions. Next, they extend the MCFE-SIC scheme to an MCFE scheme for set intersection (MCFE-SI) and prove its static security under dynamic assumptions. The decryption algorithm of their 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, they propose a decentralized MCFE scheme for set intersection (DMCFE-SI) that decentralizes the generation of function keys. Their MCFE schemes can be effectively applied to a privacy-preserving contact tracing system to prevent the spread of recent infectious diseases.
- Functional encryption for set intersection in the multi-client setting
- Two-client and multi-client functional encryption for set intersection
- From single-input to multi-client inner-product functional encryption
- Multi-client functional encryption with fine-grained access control
- Decentralizing inner-product functional encryption
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
- Advances in Cryptology - EUROCRYPT 2004
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Charm
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Decentralized multi-client functional encryption for inner product
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- From single-input to multi-client inner-product functional encryption
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Functional encryption for set intersection in the multi-client setting
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- Multi-input quadratic functional encryption from pairings
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Simple functional encryption schemes for inner products
- Two-client and multi-client functional encryption for set intersection
This page was built for publication: Decentralized multi-client functional encryption for set intersection with improved efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692968)
