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
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Threshold entrusted undeniable signature
ICISC'04 Proceedings of the 7th 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
Threshold entrusted undeniable signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
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 |
Entrusted undeniable signatures are like undeniable signatures, except that the disavowal protocol can only be run by a court in order to resolve a formal dispute. This paper introduces threshold entrusted undeniable signature scheme without trusted center. It is shown how the power to run a disavowal protocol of entrusted undeniable signature can be distributed to n agents such that any t of these can verify a signature. This facility is useful to solve “lie detector” problem of undeniable signatures.