Constrained pseudorandom functions from functional encryption
From MaRDI portal
Publication:2290626
DOI10.1016/j.tcs.2019.12.004zbMath1447.94028OpenAlexW2994422363WikidataQ122986223 ScholiaQ122986223MaRDI QIDQ2290626
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.004
functional encryptionpolynomial hardnessconstrained pseudorandom functionconstrained verifiable pseudorandom functionprivate programable pseudorandom function
Cites Work
- Unnamed Item
- Adaptively secure constrained pseudorandom functions
- Constrained PRFs for Unbounded Inputs
- Functional Encryption Without Obfuscation
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Constrained PRFs for Unbounded Inputs with Short Keys
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Function-Private Subspace-Membership Encryption and Its Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Constrained Verifiable Random Functions
- Adaptive Security of Constrained PRFs
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- How to Generate and Use Universal Samplers
- Functional Encryption: Definitions and Challenges
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Predicate Encryption for Circuits from LWE
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Indistinguishability Obfuscation from Compact Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- How to use indistinguishability obfuscation
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Functional Encryption for Randomized Functionalities
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- Breaking the Sub-Exponential Barrier in Obfustopia
- Cryptanalyses of Candidate Branching Program Obfuscators
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Protecting Obfuscation against Algebraic Attacks
- Advances in Cryptology - CRYPTO 2003
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
- Constraining Pseudorandom Functions Privately
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
This page was built for publication: Constrained pseudorandom functions from functional encryption
