Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting-Reference-Cited by-同舟云学术

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

Published:2016 Issue: Volume: Page:327-357
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2016
language:
Short-container-title:

Author:

Bootle Jonathan,Cerulli Andrea,Chaidos Pyrros,Groth Jens,Petit Christophe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-49896-5_12

Reference37 articles.

1. Lecture Notes in Computer Science;S Bayer,2012

2. Lecture Notes in Computer Science;S Bayer,2013

3. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security – CCS 1993, pp. 62–73 (1993)

4. Lecture Notes in Computer Science;E Ben-Sasson,2013

5. Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: USENIX Security Symposium 2014, pp. 781–796 (2014)

Cited by 178 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verifiable Arbitrary Queries With Zero Knowledge Confidentiality in Decentralized Storage;IEEE Transactions on Information Forensics and Security;2024

2. SM2-DualRing: Efficient SM2-based ring signature schemes with logarithmic size;Computer Standards & Interfaces;2024-01

3. Efficient Transparent Polynomial Commitments for zk-SNARKs;Computer Security – ESORICS 2023;2024

4. A Benchmark for Different Implementations of Zero-Knowledge Proof Systems;2023 IEEE International Conference on Blockchain (Blockchain);2023-12-17

5. Short Privacy-Preserving Proofs of Liabilities;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15