Simple and generic constructions of succinct functional encryption
From MaRDI portal
Publication:5918349
DOI10.1007/s00145-021-09396-xzbMath1469.94103OpenAlexW4247684423WikidataQ121033054 ScholiaQ121033054MaRDI QIDQ5918349
Keisuke Tanaka, Ryo Nishimaki, Fuyuki Kitagawa
Publication date: 30 July 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09396-x
Related Items (2)
Functional encryption with secure key leasing ⋮ Obfustopia built on secret-key functional encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient selective identity-based encryption without random oracles
- Identity-based encryption from the Diffie-Hellman assumption
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- When does functional encryption imply obfuscation?
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Bonsai trees, or how to delegate a lattice basis
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Constrained Pseudorandom Functions and Their Applications
- Pseudorandom Functions and Lattices
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Number-theoretic constructions of efficient pseudo-random functions
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Efficient Lattice (H)IBE in the Standard Model
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Indistinguishability Obfuscation from Functional Encryption
- How to use indistinguishability obfuscation
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Cryptography with Updates
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
This page was built for publication: Simple and generic constructions of succinct functional encryption
