How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Detection of disrupters in the DC protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A remark on signature scheme where forgery can be proved
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Unconditionally Secure Digital Signature Schemes Admitting Transferability
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Anonymity without 'Cryptography'
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the efficiency of group signatures providing information-theoretic anonymity
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Unconditionally secure signature schemes revisited
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 0.00 |
All known digital signature schemes can be forged by anyone having enough computing power. For a finite set of participants, we can overcome this weakness.We present a polynomial time protocol in which a participant can convince (with an exponentially small error probability) any other participant that his signature is valid. Moreover, such a convinced participant can convince any other participant of the signature's validity, without interaction with the original signer.An extension allows, in most cases, a participant who receives a signature from any source to convince each other participant of its validity. If a participant cannot use the signature to convince others, he knows so when he receives it.