Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
From MaRDI portal
Publication:1753168
DOI10.1007/s00145-017-9261-0zbMath1444.94049OpenAlexW2637740358WikidataQ121832135 ScholiaQ121832135MaRDI QIDQ1753168
Zvika Brakerski, Ilan Komargodski, Gil Segev
Publication date: 28 May 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9261-0
Related Items (7)
One-Way Functions and (Im)perfect Obfuscation ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Simple and generic constructions of succinct functional encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Non-interactive anonymous router ⋮ Multi-client functional encryption for separable functions
Cites Work
- Unnamed Item
- Mergeable functional encryption
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Functional Encryption: New Perspectives and Lower Bounds
- Constrained Pseudorandom Functions and Their Applications
- Functional Encryption with Bounded Collusions via Multi-party Computation
- On the Practical Security of Inner Product Functional Encryption
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Predicate Privacy in Encryption Systems
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Indistinguishability Obfuscation from Functional Encryption
- Identity-Based Encryption from the Weil Pairing
- How to use indistinguishability obfuscation
- Function-Private Functional Encryption in the Private-Key Setting
- Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- On Extractability Obfuscation
- One-Way Functions and (Im)perfect Obfuscation
This page was built for publication: Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
