Constraining and Watermarking PRFs from Milder Assumptions
From MaRDI portal
Publication:5041166
DOI10.1007/978-3-030-45374-9_15zbMath1501.94071OpenAlexW3021721284MaRDI QIDQ5041166
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_15
Related Items (3)
Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
Cites Work
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Private constrained PRFs (and more) from LWE
- Privately constraining and programming PRFs, the LWE way
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Riding on Asymmetry: Efficient ABE for Branching Programs
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Constrained Pseudorandom Functions and Their Applications
- Faster Bootstrapping with Polynomial Error
- New and Improved Key-Homomorphic Pseudorandom Functions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Lattice-based FHE as secure as PKE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Predicate Encryption for Circuits from LWE
- A Depth-Universal Circuit
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- How to use indistinguishability obfuscation
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Watermarking cryptographic capabilities
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Classical hardness of learning with errors
- Constraining Pseudorandom Functions Privately
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Cryptography with Updates
- On lattices, learning with errors, random linear codes, and cryptography
- Watermarking cryptographic functionalities from standard lattice assumptions
This page was built for publication: Constraining and Watermarking PRFs from Milder Assumptions
