Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
From MaRDI portal
Publication:1701449
DOI10.1007/978-3-319-70700-6_11zbMath1417.94069OpenAlexW2765641156MaRDI QIDQ1701449
Huaxiong Wang, Khoa Nguyen, Benoît Libert, San Ling
Publication date: 23 February 2018
Full work available at URL: https://hal.inria.fr/hal-01621027/file/ecash-LWR-full.pdf
Related Items (18)
Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Black-box accumulation based on lattices ⋮ Memory lower bounds of reductions revisited ⋮ Multimodal private signatures ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Lattice-based inner product argument ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Lattice-based e-cash, revisited ⋮ Acyclicity programming for sigma-protocols ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
Uses Software
Cites Work
This page was built for publication: Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
