Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
From MaRDI portal
Publication:5261668
Recommendations
Cited in
(49)- Shuffle arguments based on subset-checking
- Adaptively secure inner product encryption from LWE
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Adaptive multiparty NIKE
- On publicly-accountable zero-knowledge and small shuffle arguments
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Improving speed and security in updatable encryption schemes
- Constraining pseudorandom functions privately
- Private puncturable PRFs from standard lattice assumptions
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Full quantum equivalence of group action DLog and CDH, and more
- Quantum algorithms for variants of average-case lattice problems via filtering
- Privately constraining and programming PRFs, the LWE way
- Backward private dynamic searchable encryption with update pattern
- Constraining and watermarking PRFs from milder assumptions
- Watermarking cryptographic functionalities from standard lattice assumptions
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Extracting randomness from extractor-dependent sources
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Adaptively secure constrained pseudorandom functions in the standard model
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Full quantum equivalence of group action DLog and CDH, and more
- Pseudorandom functions in NC class from the standard LWE assumption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Cryptography with updates
- Watermarking cryptographic capabilities
- Time-lock puzzles with efficient batch solving
- Fast public-key silent OT and more from constrained Naor-Reingold
- Constrained pseudorandom functions from homomorphic secret sharing
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Private constrained PRFs (and more) from LWE
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Pseudorandom functions: three decades later
- Lattice-based functional commitments: fast verification and cryptanalysis
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- New and improved key-homomorphic pseudorandom functions
- Key-homomorphic pseudorandom functions from LWE with small modulus
- ABE for circuits with constant-size secret keys and adaptive security
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Attribute-based proxy re-encryption from standard lattices
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Constrained pseudorandom functions from functional encryption
- A lower bound for proving hardness of learning with rounding with polynomial modulus
- Revocable attribute-based proxy re-encryption
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
This page was built for publication: Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261668)
