The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures-Reference-Cited by-同舟云学术

The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures

Published:2020 Issue: Volume: Page:529-552
ISSN:0302-9743
Container-title:Progress in Cryptology – INDOCRYPT 2020
language:
Short-container-title:

Author:

Bellare Mihir,Dai Wei

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-65277-7_24

Reference52 articles.

1. Lecture Notes in Computer Science;M Abdalla,2002

2. Lecture Notes in Computer Science;M Abe,2002

3. Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 449–458. ACM Press (2008)

4. Part II, volume 11693 of LNCS;J Bartusek,2019

5. Bellare, M., Dai, W.: The multi-base discrete logarithm problem: Tight reductions and non-rewinding proofs for Schnorr identification and signatures. Cryptology ePrint Archive, Report 2020/416 (2020) https://eprint.iacr.org/2020/416

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

1. An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures;IACR Communications in Cryptology;2024-07-08

2. Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols;Journal of Cryptology;2024-06-06

3. Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA;Lecture Notes in Computer Science;2023

4. Rogue-Instance Security for Batch Knowledge Proofs;Theory of Cryptography;2023

5. Multi-user CDH Problems and the Concrete Security of NAXOS and HMQV;Topics in Cryptology – CT-RSA 2023;2023