Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Undeniable Signatures
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Weaknesses of undeniable signature schemes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
RSA-Based Undeniable Signatures for General Moduli
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
Information Security and Cryptology
A generic construction for universally-convertible undeniable signatures
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Convertible undeniable proxy signatures: security models and efficient construction
WISA'07 Proceedings of the 8th international conference on Information security applications
An efficient convertible undeniable signature scheme with delegatable verification
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
Digital signatures are important applications of public key cryptography in today's digital networks. However, they have a problem that anyone can verify the signature even if a signer wants to restrict the verifiers to confirm his signatures. D. Chaum et al.[1] proposed undeniable signatures to solve this problem. These signatures are based on the discrete logarithm problem and are extended to those with different properties [2-4]. After that, R. Gennaro et al.[5] proposed another undeniable signature scheme based on RSA. However, this scheme also has following problems. Firstly, the undeniable signature of them cannot be converted into a usual signature individually. So if a user wants to use both of the undeniable signature and the usual signature, he must prepare separate parameters for each type of signatures. Secondly, the denial protocol is not deterministic because it uses a zero knowledge interactive proof. So it is not efficient. Thirdly, their signature system cannot resist hidden verifier attack[7]. In this paper we will propose an improved scheme to solve these problems.