Simulatable verifiable random function from the LWE assumption
From MaRDI portal
Publication:2700784
DOI10.1016/j.tcs.2023.113826OpenAlexW4324387082MaRDI QIDQ2700784
Shengli Liu, Yiming Li, Jian Weng, Shuai Han, Da-Wu Gu
Publication date: 27 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113826
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- A generic approach to constructing and proving verifiable random functions
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Verifiable random functions with optimal tightness
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Verifiable Random Functions from Standard Assumptions
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Lattice Signatures without Trapdoors
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Lattice-based FHE as secure as PKE
- Compact E-Cash and Simulatable VRFs Revisited
- Trapdoors for hard lattices and new cryptographic constructions
- Constructing Verifiable Random Functions with Large Input Spaces
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Efficient Construction of (Distributed) Verifiable Random Functions
- Fiat-Shamir: from practice to theory
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Verifiable Random Functions from Weaker Assumptions
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Public Key Cryptography - PKC 2005
- On lattices, learning with errors, random linear codes, and cryptography
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
