Attacks on some RSA signatures
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Some variations on RSA signatures and their security
Proceedings on Advances in cryptology---CRYPTO '86
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Divertible zero knowledge interactive proofs and commutative random self-reducibility
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
CRYPTO '85 Advances in Cryptology
Special Uses and Sbuses of the Fiat-Shamir Passport Protocol
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
A novel ID-based designated verifier signature scheme
Information Sciences: an International Journal
On Tamper-Resistance from a Theoretical Viewpoint
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Some weaknesses of "weaknesses of undeniable signatures"
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure bit commitment function against divertibility
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
The dark side of threshold cryptography
FC'02 Proceedings of the 6th international conference on Financial cryptography
Online-untransferable signatures
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Strong designated verifier signature in a multi-user setting
AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Short (identity-based) strong designated verifier signature schemes
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Non-interactive designated verifier proofs and undeniable signatures
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
How to achieve non-repudiation of origin with privacy protection in cloud computing
Journal of Computer and System Sciences
A novel construction of SDVS with secure disavowability
Cluster Computing
| Hi-index | 0.00 |
The nice concept of undeniable signatures was presented by Chaum and van Antwerpen [10]. In [7] Chaum mentioned that "with undeniable signatures only paying customers are able to verify the signature." Using methods based on "divertible zero-knowledge proofs" and "distributed secure mental games played among cooperating users", we show that in certain contexts non-paying verifiers can check the signature as well, thus demonstrating that the applicability of undeniable signatures is somewhat restricted and must rely on the physical (or other) isolation of the verifying customer. In addition, we show that the first undeniable signature schemes suffer from certain security problems due to their multiplicative nature (similar to problems the RSA signature scheme has).