Adaptively secure constrained pseudorandom functions in the standard model
From MaRDI portal
Cites work
- A generic approach to constructing and proving verifiable random functions
- A Pseudorandom Generator from any One-way Function
- ABE for circuits with constant-size secret keys and adaptive security
- Adaptive Security of Constrained PRFs
- Adaptively secure attribute-based encryption from witness encryption
- Adaptively secure constrained pseudorandom functions
- Adaptively secure constrained pseudorandom functions in the standard model
- Adaptively secure distributed PRFs from LWE
- Adaptively secure inner product encryption from LWE
- Adaptively secure puncturable pseudorandom functions in the standard model
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- Advances in Cryptology – CRYPTO 2004
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Be adaptive, avoid overcommitting
- Bonsai trees, or how to delegate a lattice basis
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Classical hardness of learning with errors
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Constrained pseudorandom functions from homomorphic secret sharing
- Constraining pseudorandom functions privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure attribute-based encryption for t-CNF from LWE
- Functional signatures and pseudorandom functions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- How to use indistinguishability obfuscation: deniable encryption, and more
- Identity-based (lossy) trapdoor functions and applications
- Key homomorphic PRFs and their applications
- Key-homomorphic constrained pseudorandom functions
- Learning with rounding, revisited. New reduction, properties and applications
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New and improved key-homomorphic pseudorandom functions
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
- Number-theoretic constructions of efficient pseudo-random functions
- On lattices, learning with errors, random linear codes, and cryptography
- On the (im)possibility of obfuscating programs
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Private constrained PRFs (and more) from LWE
- Private puncturable PRFs from standard lattice assumptions
- Privately constraining and programming PRFs, the LWE way
- Pseudorandom Functions and Factoring
- Pseudorandom functions and lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from weaker assumptions
This page was built for publication: Adaptively secure constrained pseudorandom functions in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405017)
