Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
From MaRDI portal
Publication:1747658
DOI10.1007/s00145-016-9250-8zbMath1421.94061OpenAlexW2588101984WikidataQ121795455 ScholiaQ121795455MaRDI QIDQ1747658
Gil Segev, Ilan Komargodski, Eylon Yogev
Publication date: 26 April 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9250-8
Related Items (4)
From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Offline witness encryption with semi-adaptive security ⋮ Steel: composable hardware-based stateful and randomised functional encryption
Cites Work
- Unnamed Item
- 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
- On the Achievability of Simulation-Based Security for Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Function-Private Subspace-Membership Encryption and Its Applications
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
- Functional Encryption with Bounded Collusions via Multi-party Computation
- On the Practical Security of Inner Product Functional Encryption
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Predicate Privacy in Encryption Systems
- An Identity Based Encryption Scheme Based on Quadratic Residues
- 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
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On Extractability Obfuscation
This page was built for publication: Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
