Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log-Reference-Cited by-同舟云学术

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

Published:2005 Issue: Volume: Page:1-20
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Paillier Pascal,Vergnaud Damien

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11593447_1.pdf

Reference22 articles.

1. ANSI X9.62, Public-Key fryptography for the financial services industry: the elliptic curve digital standard algorithm (ECDSA), American National Standards Institute (1999)

2. Lecture Notes in Computer Science;M. Bellare,2004

3. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion Problems and the security of Chaum’s Blind Signature Scheme. J. Cryptology 16(3), 185–215 (2003)

4. Lecture Notes in Computer Science;M. Bellare,2002

5. Lecture Notes in Computer Science;D. Boneh,1998

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

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

2. New Limits of Provable Security and Applications to ElGamal Encryption;Lecture Notes in Computer Science;2024

3. Vector Commitments with Proofs of Smallness: Short Range Proofs and More;Lecture Notes in Computer Science;2024

4. Pairing-Free ID-Based Signatures as Secure as Discrete Logarithm in AGM;Lecture Notes in Computer Science;2024

5. On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions;Lecture Notes in Computer Science;2024