Paper 2020/1306
Simulation Extractable Versions of Groth’s zk-SNARK Revisited
Abstract
Zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) are the most efficient proof systems in terms of proof size and verification. Currently, Groth's scheme from EUROCRYPT 2016,
Note: A preliminary version of this paper appeared in the Proceedings of the 19th International Conference on Cryptology and Network Security, CANS 2020.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. International Journal of Information Security
- Keywords
- NIZKzk-SNARKStrong Simulation ExtractabilityAlgebraic Group ModelRandom Oracle Model
- Contact author(s)
-
oussamaa @ math uio no
baghery karim @ gmail com
zaira @ dusk network
carla rafols @ upf edu - History
- 2023-08-10: last of 3 revisions
- 2020-10-20: received
- See all versions
- Short URL
- https://ia.cr/2020/1306
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1306, author = {Oussama Amine and Karim Baghery and Zaira Pindado and Carla Ràfols}, title = {Simulation Extractable Versions of Groth’s zk-{SNARK} Revisited}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1306}, year = {2020}, url = {https://eprint.iacr.org/2020/1306} }