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
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th 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
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
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
Journal of Cryptology
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
Universally Composable Undeniable Signature
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Programmable Hash Functions and Their Applications
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Information Security and Cryptology
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Anonymous Signatures Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
On Generic Constructions of Designated Confirmer Signatures
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
New convertible undeniable signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Anonymous signatures made easy
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Invisibility and anonymity of undeniable and confirmer signatures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
(Convertible) undeniable signatures without random oracles
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
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
Short undeniable signatures without random oracles: the missing link
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
3-Move undeniable signature scheme
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Relations among security notions for undeniable signature schemes
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
The security of the FDH variant of Chaum's undeniable signature scheme
IEEE Transactions on Information Theory
An efficient construction of time-selective convertible undeniable signatures
ISC'11 Proceedings of the 14th international conference on Information security
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Hi-index | 0.00 |
This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting. They further satisfy unambiguity, which is traditionally required for anonymous signatures. Briefly, unambiguity means that it is hard to generate a (message, signature) pair which is valid for two different public-keys. In other words, our schemes can be viewed as anonymous signature schemes as well as convertible undeniable signature schemes. Besides other applications, we show that such schemes are very suitable for anonymous auction.