2019
DOI: 10.1007/978-3-030-26948-7_6
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
41
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 66 publications
(42 citation statements)
references
References 50 publications
1
41
0
Order By: Relevance
“…We indeed note that, as of writing, most of our building blocks (zero-knowledge proofs, PRFs, etc) remain complex tools that can hardly compete with their pairing-based counterparts. This is highlighted by the recent paper by Yang et al [38] showing that existing (insecure) lattice e-cash constructions [27,38], which use building blocks similar to ours, generate transactions ranging from 260 MB to 720 TB. Fortunately, any future improvements of these tools could easily be leveraged by our construction.…”
Section: Introductionmentioning
confidence: 60%
See 3 more Smart Citations
“…We indeed note that, as of writing, most of our building blocks (zero-knowledge proofs, PRFs, etc) remain complex tools that can hardly compete with their pairing-based counterparts. This is highlighted by the recent paper by Yang et al [38] showing that existing (insecure) lattice e-cash constructions [27,38], which use building blocks similar to ours, generate transactions ranging from 260 MB to 720 TB. Fortunately, any future improvements of these tools could easily be leveraged by our construction.…”
Section: Introductionmentioning
confidence: 60%
“…Actually, two spendings from different users may even be considered as a double-spending by the system. As a consequence, the security proofs of the e-cash construction of Libert et al [27] and of a subsequent improvement by Yang et al [38] (the only schemes relying on quantum-resistant computational assumptions) are invalid and there is no known simple fix.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Exact Lattice-Based ZKPoK are therefore an active field of research, with very recent efficient constructions for some lattice statements including linear equations with short solutions and matrix-vector relations [27] by Yang et al, new techniques when a cyclotomic polynomial fully splits in linear factors [5] by Bootle et al and new recent Stern-based contributions for proving integer relations [15] and matrix-vector relations [16] by Libert et al…”
Section: Related Workmentioning
confidence: 99%