Paper 2017/856
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
Benoît Libert, San Ling, Khoa Nguyen, and Huaxiong Wang
Abstract
Beyond their security guarantees under well-studied assumptions, algebraic pseudo-random functions are motivated by their compatibility with efficient zero-knowledge proof systems, which is useful in a number of privacy applications like digital cash. We consider the problem of proving the correct evaluation of lattice-based PRFs based on the Learning-With-Rounding (LWR) problem introduced by Banerjee et al. (Eurocrypt'12). Namely, we are interested zero-knowledge arguments of knowledge of triples
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2017
- Keywords
- Latticespseudo-random functionszero-knowledge argumentse-cash systemsanonymity
- Contact author(s)
- khoantt @ ntu edu sg
- History
- 2017-09-09: received
- Short URL
- https://ia.cr/2017/856
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/856, author = {Benoît Libert and San Ling and Khoa Nguyen and Huaxiong Wang}, title = {Zero-Knowledge Arguments for Lattice-Based {PRFs} and Applications to E-Cash}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/856}, year = {2017}, url = {https://eprint.iacr.org/2017/856} }