Efficiency Limitations for Σ-Protocols for Group Homomorphisms-Reference-Cited by-同舟云学术

Efficiency Limitations for Σ-Protocols for Group Homomorphisms

Published:2010 Issue: Volume: Page:553-571
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Bangerter Endre,Camenisch Jan,Krenn Stephan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-11799-2_33

Reference50 articles.

1. Bangerter, E., Camenisch, J., Krenn, S.: Efficiency limitations for Σ-protocols for group homomorphisms. Cryptology ePrint Archive, Report 2009/595 (2009)

2. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38, 691–729 (1991); Preliminary version in 27th FOCS (1986)

3. Schnorr, C.: Efficient signature generation by smart cards. Journal of Cryptology 4, 161–174 (1991)

4. Lecture Notes in Computer Science;L. Guillou,1990

5. Bangerter, E.: Efficient Zero-Knowledge Proofs of Knowledge for Homomorphisms. PhD thesis, Ruhr-University Bochum (2005)

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

1. Zero-Knowledge Arguments for Subverted RSA Groups;Lecture Notes in Computer Science;2023

2. Substitution Attacks Against Sigma Protocols;Cyberspace Safety and Security;2022

3. An Airdrop that Preserves Recipient Privacy;Financial Cryptography and Data Security;2020

4. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains;Advances in Cryptology – CRYPTO 2019;2019

5. Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs;Electronic Voting;2019