Abstract
Simultaneous contract signing is a two-party cryptographic protocol: two mutually suspicious parties wish to exchange signatures on a contract. We propose novel and efficient protocol for contract signing based on a construction by Even, Goldreich, and Lempel. We focus on the reduction of on-line computational complexity of the protocol. A significant part of the most time-consuming operations can be pre-computed. An important component used in our protocol is an efficient oblivious transfer, which can be of interest per se.
Chapter PDF
References
N. Asokan, V. Shoup, M. Waidner: Optimistic fair exchange of digital signatures, In Advances in Cryptology — EuroCrypt ’98, LNCS 1403, 591–606, Springer-Verlag, 2000.
D. Beaver: Minimal-latency secure function evaluation, In Advances in Cryptology — EuroCrypt ’00, LNCS 1807, 335–350, Springer-Verlag, 2000.
M. Bellare, A. Boldyreva, A. Palacio: An Un-Instantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem, Cryptology ePrint Archive, Report 2003/077, Available at eprint . iacr . org, 2003.
M. Bellare, P. Rogaway: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols, In 1 st ACM Conference on Computer and Communication Security, 62–73, ACM Press, 1993.
D. Boneh, M. Naor: Timed Commitments, In Advances in Cryptology — Crypto ’00, LNCS 1880, 236–254, Springer-Verlag, 2000.
R. Canetti: Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, Vol. 13, No. 1, 143–202, 2000.
R. Canetti, G. Goldreich, S. Halevi: The Random Oracle Methodology, Revisited, In Proceedings of the 30th ACM Symposium on Theory of Computing, 209–218, ACM Press, 1998.
W. Dai: Crypto++ 5.1 Benchmarks, Available at www.eskimo.com/weidai/benchmarks.html.
I.B. Damgård: Practical and provably secure release of a secret and exchange of signatures, In Advances in Cryptology — EuroCrypt ’93, LNCS 765, 200–217, Springer-Verlag, 1993.
S. Even, O. Goldreich, A. Lempel: A Randomized Protocol for Signing Contracts, In Advances in Cryptology: Proceedings of Crypto ’82, 205–210, Plenum Publishing, 1982.
J.A. Garay, M. Jakobsson: Timed Release of Standard Digital Signatures, In Financial Cryptography ’02, LNCS 2537, 168–182, Springer-Verlag, 2002.
J. A. Garay, M. Jakobsson, P.D. MacKenzie: Abuse-Free Optimistic Contract Signing, In Advances in Cryptology: Proceedings of Crypto ’99, LNCS 1666, 449–466, SpringerVerlag, 1999.
J.A. Garay, C. Pomerance: Timed Fair Exchange of Standard Signatures, In Financial Cryptography ’03, LNCS 2742, 190–207, Springer-Verlag, 2003.
O. Goldreich, S. Micali, A. Wigderson: How to play any mental game — a completeness theorem for protocols with honest majority, In 19th ACM Symposium on the Theory of Computing, 218–229, ACM Press, 1987.
Y. Ishai, J. Kilian, K. Nissim, E. Petrank: Extending Oblivious Transfers Efficiently, Advances in Cryptology — Crypto 2003, LNCS 2729, 145–161, Springer-Verlag, 2003.
A. Juels, M. Szydlo: An Two-Server Auction Protocol, In Financial Cryptography ’02, LNCS 2537, Springer-Verlag, 2002.
M. Naor, B. Pinkas, R. Sumner: Privacy preserving auctions and mechanism design, In 1 st ACM Conference on Electronic Commerce, 129–139, ACM Press, 1999.
M. Naor, B. Pinkas: Efficient oblivious transfer protocols, In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 448–457, 2001.
B. Pfitzmann, M. Schunter, M. Waidner: Optimal Efficiency of Optimistic Contract Signing, In Symposium on Principles of Distributed Computing, 113–122, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Líšková, L., Stanek, M. (2004). Efficient Simultaneous Contract Signing. In: Deswarte, Y., Cuppens, F., Jajodia, S., Wang, L. (eds) Security and Protection in Information Processing Systems. SEC 2004. IFIP — The International Federation for Information Processing, vol 147. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8143-X_29
Download citation
DOI: https://doi.org/10.1007/1-4020-8143-X_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-8016-1
Online ISBN: 978-1-4020-8143-9
eBook Packages: Springer Book Archive