Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 87–105Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Fair Secure Two-Party Computation

Fair Secure Two-Party Computation

Extended Abstract

  • Benny Pinkas5 
  • Conference paper
  • First Online: 01 January 2003
  • 4125 Accesses

  • 57 Citations

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2656)

Abstract

We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of gradual release timed commitments, which are a new variant of timed commitments, and on a novel use of blind signatures for verifying that the committed values are correct.

Keywords

  • Reserve Price
  • Blind Signature
  • Commitment Scheme
  • Oblivious Transfer
  • Gradual Release

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. B. Baum-Waidner and M. Waidner, Optimistic asynchronous multi-party contract signing, Research report RZ 3078 (# 93124), IBM Research, Nov. 1998.

    Google Scholar 

  2. D. Beaver and S. Goldwasser, Multiparty computation with faulty majority, Proc. 30th FOCS, pp. 468–473, 1989.

    Google Scholar 

  3. M. Bellare and S. Goldwasser, Verifiable partial key escrow, 4th ACM CCS conference, pp. 78–91, 1997.

    Google Scholar 

  4. M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko, The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature scheme, in proc. of Financial Crypto’ 01, 2001.

    Google Scholar 

  5. M. Ben-Or, O. Goldreich. S. Micali and R. L. Rivest, A fair protocol for signing contracts, IEEE Trans. on Information Theory, vol. 36, 40–46, Jan. 1990.

    CrossRef  Google Scholar 

  6. M. Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems, 1(2):175–193, May 1983.

    CrossRef  Google Scholar 

  7. L. Blum, M. Blum, and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, Vol. 15, pp. 364–383, May 1986.

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. D. Boneh and M. Naor, Timed commitments, Advances in Cryptology — Crypto’ 2000, Springer-Verlag LNCS 1880, 236–254, 2000.

    CrossRef  Google Scholar 

  9. F. Boudot, B. Schoenmakers and J. Traore, A Fair and Efficient Solution to the Socialist Millionaires’ Problem, Discrete App. Math. 111, pp. 23–36, July 2001.

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. E. Brickell, D. Chaum, I. Damgard and J. van de Graaf, Gradual and verifiable release of a secret, Adv. in Crypt. — Crypto’ 87, Springer-Verlag LNCS 293, 1988.

    Google Scholar 

  11. C. Cachin and J. Camenish, Optimistic fair secure computation, Advances in Cryptology — Crypto’ 2000, Springer-Verlag LNCS 1880, 94–112, 2000.

    CrossRef  Google Scholar 

  12. D. Chaum, Blind signatures for untraceable payments, Advances in Cryptology — Crypto’ 82, pp. 199–203, 1982.

    Google Scholar 

  13. D. Chaum and T. Pedersen, Wallet databases with observers, Advances in Cryptology — Crypto’ 92, Springer-Verlag, pp. 89–105, 1992.

    Google Scholar 

  14. R. Cleve, Limits on the security of coin flips when half the processors are faulty, STOC’ 86, 364–369, 1986.

    Google Scholar 

  15. R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, Adv. in Crypt. — Crypto’ 89, Springer-Verlag, LNCS 435, 573–588, 1990.

    CrossRef  Google Scholar 

  16. R. Cramer, I. Damgard and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Advances in Cryptology — Crypto’ 94, Springer Verlag LNCS, vol. 839, pp. 174–187, 1994.

    Google Scholar 

  17. I. Damgard, Practical and provably secure release of a secret and exchange of signatures, J. Cryptology, 8(4):201–222, 1995.

    CrossRef  MATH  Google Scholar 

  18. C. Dwork and M. Naor, Pricing via processing, or combatting junk email, Advances in Cryptology — Crypto’ 92, Springer-Verlag, 139–147, 1990.

    Google Scholar 

  19. M. Franklin, Complexity and security of distributed protocols, PhD dissertation, Columbia University, 1993.

    Google Scholar 

  20. Z. Galil, S. Haber and M. Yung, Cryptographic Computation: Secure Faulttolerant Protocols and the Public-Key Model, Advances in Cryptology — Crypto’ 87, Springer-Verlag LNCS 293, 135–155, 1988.

    Google Scholar 

  21. J. Garay and M. Jakobsson, Timed Release of Standard Digital Signatures, Proc. Financial Cryptography 2002, March 2002.

    Google Scholar 

  22. O. Goldreich, Foundations of Cryptography (Fragments of a Book), 1995. Available at http://www.wisdom.weizmann.ac.il/~oded/frag.html.

  23. O. Goldreich and L.A. Levin, A hard-core predicate for all one-way functions, Proc. of the 21st ACM Symposium on Theory of Computing (STOC), pp. 25–32, 1989.

    Google Scholar 

  24. S. Goldwasser and L. Levin, Fair computation of general functions in presence of immoral majority, Adv. in Crypt. — Crypto’ 90, Springer-Verlag LNCS 537, 1991.

    CrossRef  Google Scholar 

  25. M. Luby, S. Micali and C. Rackoff, How to simultaneously exchange secret bit by flipping a symmetrically-biased coin, Proceedings of FOCS’ 83, 23–30, 1983.

    Google Scholar 

  26. W. Mao, Timed-Release Cryptography, Selected Areas in Cryptography VIII (SAC’01), Springer-Verlag LNCS 2259, pp. 342–357, 2001.

    CrossRef  Google Scholar 

  27. S. Micali, Secure protocols with invisible trusted parties, presented at the Workshop for Multi-Party Secure Protocols, Weizmann Inst. of Science, June 1998.

    Google Scholar 

  28. M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, Proceedings of SODA 2001 (SIAM Symposium on Discrete Algorithms), January 7–9 2001.

    Google Scholar 

  29. R. Rivest, A. Shamir and D. Wagner, Timed lock puzzles and timed release cryptography, TR MIT/LC/TR-684, 1996.

    Google Scholar 

  30. A. Yao, Protocols for secure computation, Annual Symposium on Foundations of Computer Science (FOCS), 162–167, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HP Labs, UK

    Benny Pinkas

Authors
  1. Benny Pinkas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints and Permissions

Copyright information

© 2003 International Association for Cryptologic Research

About this paper

Cite this paper

Pinkas, B. (2003). Fair Secure Two-Party Computation. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_6

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_6

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

  • Online ISBN: 978-3-540-39200-2

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature