Fair secure two-party computation: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2656, Issue , 2003, Pages 87-105

  Pinkas, Benny ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BLIND SIGNATURES; SECURE TWO-PARTY COMPUTATIONS; TRUSTED THIRD PARTIES;

COMPUTATION THEORY;

EID: 35248883427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_6     Document Type: Article

References (30)

1. B. Baum-Waidner and M. Waidner, Optimistic asynchronous multi-party contract signing, Research report RZ 3078 (# 93124), IBM Research, Nov. 1998.
2. D. Beaver and S. Goldwasser, Multiparty computation with faulty majority, Proc. 30th FOCS, pp. 468-473, 1989.
3. M. Bellare and S. Goldwasser, Verifiable partial key escrow, 4th ACM CCS conference, pp. 78-91, 1997.
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.
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.
6. M. Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems, 1(2):175-193, May 1983.
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.
8. D. Boneh and M. Naor, Timed commitments, Advances in Cryptology - Crypto '2000, Springer-Verlag LNCS 1880, 236-254, 2000.
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.
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.
11. C. Cachin and J. Camenish, Optimistic fair secure computation, Advances in Cryptology - Crypto '2000, Springer-Verlag LNCS 1880, 94-112, 2000.
12. D. Chaum, Blind signatures for untraceable payments, Advances in Cryptology - Crypto '82, pp. 199-203, 1982.
13. D. Chaum and T. Pedersen, Wallet databases with observers, Advances in Cryptology - Crypto '92, Springer-Verlag, pp. 89-105, 1992.
14. R. Cleve, Limits on the security of coin flips when half the processors are faulty, STOC '86, 364-369, 1986.
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.
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.
17. I. Damgard, Practical and provably secure release of a secret and exchange of signatures, J. Cryptology, 8(4):201-222, 1995.
18. C. Dwork and M. Naor, Pricing via processing, or combatting junk email, Advances in Cryptology - Crypto '92, Springer-Verlag, 139-147, 1990.
19. M. Franklin, Complexity and security of distributed protocols, PhD dissertation, Columbia University, 1993.
20. Z. Galil, S. Haber and M. Yung, Cryptographic Computation: Secure Fault-tolerant Protocols and the Public-Key Model, Advances in Cryptology - Crypto '87, Springer-Verlag LNCS 293, 135-155, 1988.
21. J. Garay and M. Jakobsson, Timed Release of Standard Digital Signatures, Proc. Financial Cryptography 2002, March 2002.
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.
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.
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.
26. W. Mao, Timed-Release Cryptography, Selected Areas in Cryptography VIII (SAC '01), Springer-Verlag LNCS 2259, pp. 342-357, 2001.
27. S. Micali, Secure protocols with invisible trusted parties, presented at the Workshop for Multi-Party Secure Protocols, Weizmann Inst. of Science, June 1998.
28. M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, Proceedings of SODA 2001 (SIAM Symposium on Discrete Algorithms), January 7-9 2001.
29. R. Rivest, A. Shamir and D. Wagner, Timed lock puzzles and timed release cryptography, TR MIT/LC/TR-684, 1996.
30. A. Yao, Protocols for secure computation, Annual Symposium on Foundations of Computer Science (FOCS), 162-167, 1986.