Shorter ZK-SNARKs from square span programs over ideal lattices

Shorter ZK-SNARKs from square span programs over ideal lattices

Abstract Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are cryptographic protocols that offer efficient and privacy-preserving means of verifying NP language relations and have drawn considerable attention for their appealing applications, e.g., verifiable computation an...

Full description

Bibliographic Details
Main Authors: Xi Lin, Heyang Cao, Feng-Hao Liu, Zhedong Wang, Mingsheng Wang
Format: Article
Language:English
Published: SpringerOpen 2024-03-01
Series:Cybersecurity
Subjects:
Zk-SNARKs
Post-quantum
Succinct argument
Online Access:https://doi.org/10.1186/s42400-024-00215-x

Internet

https://doi.org/10.1186/s42400-024-00215-x

Similar Items