A randomized protocol for signing contracts
Communications of the ACM
Proceedings of CRYPTO 84 on Advances in cryptology
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
CRYPTO '94 Proceedings of the 14th 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
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
NetBill security and transaction protocol
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Optimistic Fair Exchange with Transparent Signature Recovery
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Undeniable Confirmer Signature
ISW '99 Proceedings of the Second International Workshop on Information Security
An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
ISC '01 Proceedings of the 4th International Conference on Information Security
Certified E-Mail Delivery with DSA Receipts
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18
Providing Certified Mail Services on the Internet
IEEE Security and Privacy
Fair exchange protocol of Schnorr signatures with semi-trusted adjudicator
Computers and Electrical Engineering
Fair exchange of valuable information: A generalised framework
Journal of Computer and System Sciences
A new construction of designated confirmer signature and its application to optimistic fair exchange
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Contract signature in e-commerce
Computers and Electrical Engineering
The fairness of perfect concurrent signatures
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Efficient fair certified e-mail delivery based on RSA
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Efficient identity-based protocol for fair certified e-mail delivery
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
RSA extended modulus attacks and their solutions in a kind of fair exchange protocols
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
An efficient certified email protocol
ISC'07 Proceedings of the 10th international conference on Information Security
Information Sciences: an International Journal
| Hi-index | 0.00 |
We propose a new efficient protocol, which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way, such that after the protocol is running, either each party obtains the other's signature, or neither of them does. The protocol relies on an off-line Trusted Third Party (TTP), which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called confirmable signatures (or designated confirmer signatures in its original proposal [9]). We recommend using a new efficient confirmable signature scheme in the proposed fair exchange protocol. This scheme combines the family of discrete logarithm (DL) based signature algorithms and a zero-knowledge (ZK) proof on the equality of two DLs. The protocol has a practical level of performance: only a moderate number of communication rounds and ordinary signatures are required. The security of the protocol can be established from that of the underlying signature algorithms and that of the ZK proof used.