Authors
Rosario Gennaro, Michele Minelli, Anca Nitulescu, Michele Orrų
Publication date
2018/10/15
Book
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
Pages
556-573
Description
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and efficiently verifiable proofs. They elegantly resolve the juxtaposition of individual privacy and public trust, by providing an efficient way of demonstrating knowledge of secret information without actually revealing it. To this day, zk-SNARKs are being used for delegating computation, electronic cryptocurrencies, and anonymous credentials. However, all current SNARKs implementations rely on pre-quantum assumptions and, for this reason, are not expected to withstand cryptanalitic efforts over the next few decades. In this work, we introduce the first designated-verifier zk-SNARK based on lattice assumptions, which are believed to be post-quantum secure. We provide a generalization in the spirit of Gennaro et al. (Eurocrypt'13) to the SNARK of Danezis et al. (Asiacrypt'14) that is based on Square Span Programs (SSPs) and …
Total citations
20182019202020212022202320241814612164
Scholar articles
R Gennaro, M Minelli, A Nitulescu, M Orrų - Proceedings of the 2018 ACM SIGSAC Conference on …, 2018