Simulatable verifiable random function from the LWE assumption

DOI10.1016/J.TCS.2023.113826MaRDI QIDQ2700784zbMATH OpenOpenAlexFDO

Authors Yiming Li, Shengli Liu, Shuai Han, Jian Weng, Dawu 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

zbMATH Keywords

LWEsimulatable verifiable random functiontrapdoor fully homomorphic commitment

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Simulatable VRFs with Applications to Multi-theorem NIZK
• A generic approach to constructing and proving verifiable random functions
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Weak Verifiable Random Functions
• Verifiable random functions from non-interactive witness-indistinguishable proofs

Cites work

• A generic approach to constructing and proving verifiable random functions
• Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
• An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• Compact E-Cash and Simulatable VRFs Revisited
• Constructing verifiable random functions with large input spaces
• Efficient Construction of (Distributed) Verifiable Random Functions
• Faster Bootstrapping with Polynomial Error
• Fiat-Shamir: from practice to theory
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Generating shorter bases for hard random lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 708808 (Why is no real title available?)
• scientific article; zbMATH DE number 1942446 (Why is no real title available?)
• scientific article; zbMATH DE number 2079926 (Why is no real title available?)
• scientific article; zbMATH DE number 1405637 (Why is no real title available?)
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
• Lattice signatures without trapdoors
• Lattice-based FHE as secure as PKE
• Leveled fully homomorphic signatures from standard lattices
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• On lattices, learning with errors, random linear codes, and cryptography
• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Pseudorandom functions and lattices
• Public Key Cryptography - PKC 2005
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from standard assumptions
• Verifiable random functions from weaker assumptions
• Verifiable random functions with optimal tightness
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash

Cited in

(4)

• Practical post-quantum few-time verifiable random function with applications to Algorand
• Compact E-Cash and Simulatable VRFs Revisited
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs

This page was built for publication: Simulatable verifiable random function from the LWE assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700784)