Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
From MaRDI portal
Publication:6085266
DOI10.1007/978-3-031-30620-4_6OpenAlexW4365806846MaRDI QIDQ6085266
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptively secure distributed PRFs from LWE
- Be adaptive, avoid overcommitting
- Constrained keys for invertible pseudorandom functions
- Private constrained PRFs (and more) from LWE
- A generic approach to constructing and proving verifiable random functions
- Privately constraining and programming PRFs, the LWE way
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Adaptively secure constrained pseudorandom functions in the standard model
- Collusion resistant watermarkable PRFs from standard assumptions
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Adaptively secure constrained pseudorandom functions
- Reducing Depth in Constrained PRFs: From Bit-Fixing to $$\mathbf {NC}^{1}$$
- Constrained PRFs for Unbounded Inputs
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- Constrained PRFs for Unbounded Inputs with Short Keys
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Programmable Hash Functions in the Multilinear Setting
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Constrained Verifiable Random Functions
- Adaptive Security of Constrained PRFs
- Function Secret Sharing
- Expander codes
- Predicate Encryption for Circuits from LWE
- On expander codes
- Constraining and Watermarking PRFs from Milder Assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Verifiable Random Functions from Weaker Assumptions
- Advances in Cryptology – CRYPTO 2004
- Watermarking cryptographic capabilities
- Functional Signatures and Pseudorandom Functions
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Distributed Point Functions and Their Applications
- Classical hardness of learning with errors
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
- Constraining Pseudorandom Functions Privately
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Computational Complexity
- On lattices, learning with errors, random linear codes, and cryptography
- Watermarking cryptographic functionalities from standard lattice assumptions
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- One-One Constrained Pseudorandom Functions.
This page was built for publication: Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
