Fairplay - A secure two-party computation system

Proceedings of the 13th USENIX Security Symposium

Volumn , Issue , 2004, Pages

  Malkhi, Dahlia ^a   Nisan, Noam ^a   Pinkas, Benny ^b   Sella, Yaron ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PETROLEUM RESERVOIR EVALUATION; PROGRAM COMPILERS;

BOOLEAN CIRCUIT; COMMUNICATION SPEED; OBLIVIOUS TRANSFER; ONE-PASS; RAPID GROWTH; SECURE FUNCTION EVALUATION; SECURE TWO-PARTY COMPUTATIONS;

HIGH LEVEL LANGUAGES;

EID: 85084163840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. th-ranked element. In Avdances in Cryptology - Proc. of Eurocyrpt '04, 2004.
2. B. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. In Proceedings of Eurocrypt '01, LNCS, Volume 2045, 2001.
3. S. Ajmani, R. Morris, and B. Liskov. A trusted third-party computation service. Technical Report MIT-LCSTR-847, MIT, May 2001.
4. Z. Balshai, A. Levy, and N. Nisan. A secure funcation definition language (SFDL) compiler. in preparation.
5. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC), pages 503-513, 1990.
6. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In Proceedings of Crypto 89, pages 547-557, 1990.
7. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st Annual Conference on Computer and Communications Security, pages 62-73, 1993.
8. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non cryptographic fault tolerant distributed computation. In Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), pages 1-9, 1988.
9. R. Bergamaschi, R. Damiano, A. Drumm, and L. Trevillyan. Synthesis for the '90s: Highlevel and logic synthesis techniques. In ICCAD93 Tutorial Notes, 1993.
10. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of FOCS, 2001.
11. R. Canetti, Y. Ishai, R. Kumar, M. Reiter, R. Rubinfeld, and R. Wright. Selective private function evaluation with applications to private statistics. In Proceedings of Twentieth ACM Symposium on Principles of Distributed Computing (PODC), 2001.
12. R. Canetti, Y Lindell, R. Ostrovsky, and A. Sahai. Universally composable two party computation. In Proceedings of the 34th ACM Symposium on the Theory of Computing (STOC), 2002.
13. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proceedings of the 36th FOCS, pages 41-50, 1995.
14. D. R. Coelho. The VHDL Handbook. Kluwer Academic Publisher, Norwell, MA, 1989.
15. R. Cytron, J. Ferrante, B. K. Rosen, M.N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
16. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
17. J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 1-13, 2002.
18. D. Galloway. The transmogrifier c hardware description language and compiler for fpgas. In D. A. Buell and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 136-144, April 1995.
19. M. Gokhale and E. Gomersall. High level compilation for fine grained fpgas. In J. Arnold and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 165-173, April 1997.
20. O. Goldreich. The Foundations of Cryptography - Volume 2, Ch. 7. 2004.
21. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
22. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, 1996.
23. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 13(1):31-60, 2000.
24. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In Proceedings of Crypto '03, LNCS 2729, pages 145-161. Springer-Verlag, 2003.
25. T. Kühne. Evaluation, design and implementierung von multi-party-berechnungen. Master's thesis, ETH Zürich, September 1997.
26. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2003.
27. P. MacKenzie, A. Oprea, and M. K. Reiter. Automatic generation of two-party computations. In Proceedings of the 10th ACM Conference on Computer and Communications Security, October 2003.
28. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. The Fairplay project. http://www.cs.huji.ac.il/labs/danss/Fairplay.
29. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the 31st Symposium on Theory of Computer Science (STOC), pages 245-254, 1999.
30. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proceedings of SODA 01, 2001.
31. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. of the 1st ACM conf. on Electronic Commerce, 1999.
32. N. Nisan. Algorithms for selfish agents - mechanism design for distributed computation. In STACS, 1999.
33. J. B. Peterson, R. B. O'Connor, and P. M. Athanas. Scheduling and partitioning ansi-c programs onto multifpga ccm architectures. In J. Arnold and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 178-187, April 1996.
34. B. Pinkas. Fair secure two-party computation. In Proceedings of Eurocrypt '03, LNCS 2656, pages 87-105. Springer-Verlag, 2003.
35. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communication of the ACM, (21):120-126, 1978.
36. D. Song, A. Perrig, and D. Phan. AGVI - automatic generation, verification, and implementation of security protocols. In 13th Conference on Computer Aided Verification (CAV), 2001.
37. D. E. Thomas and P. R. Moorby. The Verilog hardware description language. Kluwer Academic Publishing, Boston, MA, 1991.
38. T. Yamauchi, S. Nakaya, and N. Kajihara. Sop: A reconfigurable massively parallel system and its controldata-flow based compiling method. In J. Arnold and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 148-156, April 1996.
39. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.
40. S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Untrusted hosts and confidentiality: Secure program partitioning. ACM Transactions on Computer Systems, 20(3):283-328, 2002.