Constrained pseudorandom functions from functional encryption
From MaRDI portal
Recommendations
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Adaptively secure constrained pseudorandom functions in the standard model
- Adaptively secure constrained pseudorandom functions
- Constraining pseudorandom functions privately
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- A punctured programming approach to adaptively secure functional encryption
- Adaptive Security of Constrained PRFs
- Adaptively secure constrained pseudorandom functions
- Adaptively secure puncturable pseudorandom functions in the standard model
- Advances in Cryptology - CRYPTO 2003
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Breaking the sub-exponential barrier in obfustopia
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Constrained PRFs for unbounded inputs
- Constrained PRFs for unbounded inputs with short keys
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Constrained verifiable random functions
- Constraining pseudorandom functions privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of GGH map
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Cryptanalysis of the multilinear map over the integers
- Cryptanalysis of the new CLT multilinear map over the integers
- From Minicrypt to Obfustopia via private-key functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- Function-private identity-based encryption: hiding the function in functional encryption
- Function-private subspace-membership encryption and its applications
- Functional encryption for randomized functionalities
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional signatures and pseudorandom functions
- Graph-induced multilinear maps from lattices
- How to Generate and Use Universal Samplers
- How to obfuscate programs directly
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Key-homomorphic constrained pseudorandom functions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New Multilinear Maps Over the Integers
- Obfuscating circuits via composite-order graded encoding
- On the (im)possibility of obfuscating programs
- Practical multilinear maps over the integers
- Predicate encryption for circuits from LWE
- Private puncturable PRFs from standard lattice assumptions
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Reusable garbled circuits and succinct functional encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Witness encryption and its applications
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(10)- Constrained Pseudorandom Functions for Unconstrained Inputs
- Functional signatures and pseudorandom functions
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Pseudorandom functions from LWE: RKA security and application
- Adaptively secure constrained pseudorandom functions in the standard model
- Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
- Key regression from constrained pseudorandom functions
- Publicly evaluable pseudorandom functions and their applications
This page was built for publication: Constrained pseudorandom functions from functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290626)
