A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
How To Construct Randolli Functions
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
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
Threshold Undeniable RSA Signature Scheme
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Off-Line Fair Payment Protocols Using Convertible Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Undeniable Confirmer Signature
ISW '99 Proceedings of the Second International Workshop on Information Security
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
Designs, Codes and Cryptography
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
Information Security and Cryptology
Universally Composable Undeniable Signature
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Efficient Deniable Authentication for Signatures
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Anonymity from Public Key Encryption to Undeniable Signatures
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Convertible group undeniable signatures
ICISC'02 Proceedings of the 5th international conference on 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
(Convertible) undeniable signatures without random oracles
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Provably secure convertible undeniable signatures with unambiguity
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A framework for constructing convertible undeniable signatures
ProvSec'10 Proceedings of the 4th international conference on Provable security
Short convertible undeniable signature in the standard model
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
An efficient construction of time-selective convertible undeniable signatures
ISC'11 Proceedings of the 14th international conference on Information security
On the generic construction of identity-based signatures with additional properties
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
New approach for selectively convertible undeniable signature schemes
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Conditionally verifiable signature
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
The security of the FDH variant of chaum's undeniable signature scheme
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Time-selective convertible undeniable signatures
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
3-Move undeniable signature scheme
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
An efficient convertible undeniable signature scheme with delegatable verification
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Relations among security notions for undeniable signature schemes
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Non-interactive designated verifier proofs and undeniable signatures
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Certificateless undeniable signatures from bilinear maps
Information Sciences: an International Journal
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Short and efficient convertible undeniable signature schemes without random oracles
Theoretical Computer Science
| Hi-index | 0.00 |
Undeniable signatures are like ordinary digital signatures, except that testing validity of a signature requires interaction with the signer. This gives the signer additional control over who will benefit from being convinced by a signature, and is particularly relevant when signing sensitive, non-public data. Convertible undeniable signatures offer additional flexibility in that there is a separate verification key that can be used to verify a signature (without interaction). This allows the signer to delegate the ability to verify signatures to one or more participants, and ultimately to convert all signatures to ordinary ones by making the verification key public. While provably secure theoretical solutions exist for convertible schemes, earlier practical schemes proposed have either been broken or their status as far as security is concerned is very unclear. In this paper, we present two new convertible schemes, in which forging signatures is provably equivalent to forging El Gamal signatures. The difficulty of verifying signatures without interacting with the signer is based on the factoring problem for one of the schemes and on the Diffie-Hellman problem for the other scheme.