A provably secure oblivious transfer protocol
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
ACM Transactions on Computer Systems (TOCS)
A randomized protocol for signing contracts
Communications of the ACM
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
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Designs, Codes and Cryptography
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Selective Receipt in Certified E-mail
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Efficient Fair Exchange with Verifiable Confirmation of Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Optimistic Fair Exchange with Transparent Signature Recovery
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Future Generation Computer Systems
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On fairness in exchange protocols
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
A design of fair blind signatures protocol using PVNIOT
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Design and implementation of an inline certified e-mail service
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
A new secure oblivious transfer protocol
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
An intensive survey of fair non-repudiation protocols
Computer Communications
| Hi-index | 0.02 |
We consider two problems which arose in the context of "The Exchange of Secret Keys" (see [1]).(1). In the original protocol, one party may halt the exchange and have a 2 to 1 expected time advantage in computing the other party's secret. To solve this problem, when there is a particular point in the exchange where this time advantage may be critical, we presented at CRYPTO 83 (see [5]), a method for exchanging "fractions" of a single bit.In this paper we extend the method so as to apply it to all bits to be exchanged, and show how it can be used in a more abstract setting (as in [2]).(2). We also present a solution to the problem of how to ensure a fair exchange of secrets when one party in the exchange is "risk seeking", while the other is "risk-adverse".