Adaptively secure constrained pseudorandom functions in the standard model
From MaRDI portal
Publication:2096499
DOI10.1007/978-3-030-56784-2_19zbMATH Open1501.94038OpenAlexW3013595713MaRDI QIDQ2096499FDOQ2096499
Authors: Alex Davidson, Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_19
Recommendations
Cites Work
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- A Pseudorandom Generator from any One-way Function
- Efficient Identity-Based Encryption Without Random Oracles
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Number-theoretic constructions of efficient pseudo-random functions
- Title not available (Why is that?)
- How to use indistinguishability obfuscation
- Pseudorandom Functions and Factoring
- Advances in Cryptology – CRYPTO 2004
- Pseudorandom functions and lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Identity-based (lossy) trapdoor functions and applications
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Constrained pseudorandom functions and their applications
- Adaptively secure distributed PRFs from LWE
- Private constrained PRFs (and more) from LWE
- Privately constraining and programming PRFs, the LWE way
- Learning with rounding, revisited. New reduction, properties and applications
- Key homomorphic PRFs and their applications
- New and improved key-homomorphic pseudorandom functions
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Verifiable random functions from weaker assumptions
- Functional signatures and pseudorandom functions
- Constraining pseudorandom functions privately
- Private puncturable PRFs from standard lattice assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Adaptively secure puncturable pseudorandom functions in the standard model
- Adaptive Security of Constrained PRFs
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- Adaptively secure constrained pseudorandom functions
- Key-homomorphic constrained pseudorandom functions
Cited In (18)
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- The power of undirected rewindings for adaptive security
- Adaptively secure constrained pseudorandom functions
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
- From non-adaptive to adaptive pseudorandom functions
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- One-One Constrained Pseudorandom Functions.
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Adaptive multiparty NIKE
- Adaptively secure puncturable pseudorandom functions in the standard model
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Verifiable random functions with optimal tightness
- Constrained pseudorandom functions from homomorphic secret sharing
- Efficient and fully secure lattice-based IBE with equality test
- Non-naturally reductive Einstein metrics on \(\mathrm {SO}(n)\)
- Constrained pseudorandom functions from functional encryption
- Adaptive Security of Constrained PRFs
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 Q2096499)
