How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th 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
Short Signatures from the Weil Pairing
Journal of Cryptology
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Confirmer signature schemes secure against adaptive adversaries
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
(Convertible) undeniable signatures without random oracles
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Short undeniable signatures without random oracles: the missing link
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Anonymity from Public Key Encryption to Undeniable Signatures
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
On Generic Constructions of Designated Confirmer Signatures
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
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
Non-interactive confirmer signatures
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Short convertible undeniable signature in the standard model
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
An efficient convertible undeniable signature scheme with delegatable verification
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Short and efficient convertible undeniable signature schemes without random oracles
Theoretical Computer Science
| Hi-index | 0.00 |
Undeniable signatures were proposed to limit the verification property of ordinary digital signatures. In fact, the verification of such signatures cannot be attained without the help of the signer, via the confirmation/denial protocols. Later, the concept was refined to give the possibility of converting the issued undeniable signatures into ordinary ones by publishing a universal receipt that turns them publicly verifiable. In this paper, we present the first generic construction for universally convertible undeniable signatures from certain weakly secure cryptosystems and any secure digital signature scheme. Next, we give two specific approaches for building universally convertible undeniable signatures from a large class of pairing-based signatures. These methods find a nice and practical instantiation with known encryption and signature schemes. For instance, we achieve the most efficient undeniable signatures with regard to the signature length and cost, the underlying assumption and the security model. We believe these constructions could be an interesting starting point to develop more efficient schemes or give better security analyses of the existing ones.