Private Puncturable PRFs from Standard Lattice Assumptions
From MaRDI portal
Publication:5738885
DOI10.1007/978-3-319-56620-7_15zbMath1410.94049MaRDI QIDQ5738885
No author found.
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (22)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Watermarking PRFs under standard assumptions: public marking and security with extraction queries ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Programmable distributed point functions ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Optimal single-server private information retrieval ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ NIKE from affine determinant programs ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Revocable attribute-based proxy re-encryption ⋮ Private information retrieval with sublinear online time ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained PRFs for Unbounded Inputs
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- Riding on Asymmetry: Efficient ABE for Branching Programs
- (Leveled) fully homomorphic encryption without bootstrapping
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key Homomorphic PRFs and Their Applications
- Functional Encryption: New Perspectives and Lower Bounds
- Constrained Pseudorandom Functions and Their Applications
- Faster Bootstrapping with Polynomial Error
- New and Improved Key-Homomorphic Pseudorandom Functions
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Constrained Verifiable Random Functions
- Adaptive Security of Constrained PRFs
- Predicate Encryption for Multi-dimensional Range Queries from Lattices
- Function Secret Sharing
- Lattice-based FHE as secure as PKE
- Functional Encryption: Definitions and Challenges
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Private information retrieval
- Multi-key FHE from LWE, Revisited
- Targeted Homomorphic Attribute-Based Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Predicate Encryption for Circuits from LWE
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Efficient Lattice (H)IBE in the Standard Model
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- How to use indistinguishability obfuscation
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Graph-Induced Multilinear Maps from Lattices
- Advances in Cryptology - EUROCRYPT 2004
- Watermarking cryptographic capabilities
- Fuzzy Identity-Based Encryption
- Functional Signatures and Pseudorandom Functions
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Distributed Point Functions and Their Applications
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Attribute-based encryption for 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
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Private Puncturable PRFs from Standard Lattice Assumptions
