Secure function evaluation with ordered binary decision diagrams

ABSTRACT

Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptographic primitive for designing privacy-preserving protocols is secure function evaluation (SFE). The classic solution for SFE by Yao uses a gate representation of the function that the two parties want to jointly compute. Fairplay is a system that implements the classic solution for SFE. In this paper, we present a new protocol for SFE that uses a graph-based representation of the function. Specifically we use the graph-based representation called ordered binary decision diagrams (OBDDs). For a large number of Boolean functions, OBDDs are more succinct than the gate-based representation. Preliminary experimental results based on a prototype implementation shows that for several functions, our protocol results in a smaller bandwidth than Fairplay. For example, for the classic millionaire's problem, our new protocol results in a approximately $45$\% bandwidth reduction over Fairplay. Therefore, our protocols will be particularly useful for applications for environments with limited bandwidth, such as applications for wireless and sensor networks.

References

1. Gagan Aggarwal, Nina Mishra, and Benny Pinkas. Secure computation of the k-th ranked element. In Christian Cachin and Jan Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 40--55. Springer-Verlag, May 2004.
2. Beate Bollig and Ingo Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9), September 1996.
3. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677--691, 1986.
4. Randal E. Bryant and Yirng-An Chen. Verification of arithmetic circuits with binary moment diagrams. In Proceedings of the 32nd Conference on Design Automation (DAC), 1995.
5. Buddy. http://sourceforge.net/projects/buddy.
6. A. Campailla, S. Chaki, E. M. Clarke, S. Jha, and H. Veith. Efficient filtering in publish-subscribe systems using binary decision diagrams. In Proceedings of the 23rd International Conference on Software Engineering (ICSE), 2001.
7. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 2000.
8. E.M. Clarke, M. Khaira, and X. Zhao. Hybrid decision diagrams: Overcoming the limitations of MTBDDs and BMDs. In Proceedings of the International Conference on Computer-Aided Design (ICCAD), 1995.
9. Lorrie Cranor, Marc Langheinrich, Massimo Marchiori, Martin Presler-Marshall, and Joseph Reagle. The Platform for Privacy Preferences 1.0 (P3P1.0) Specification. W3C Recommendation, 16 April 2002.
10. Lorrie Faith Cranor. Internet privacy. Communications of the ACM, 42(2):28--38, 1999.
11. J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean. Secure computation of surveys. In 2004 EU Workshop on Secure Multiparty Protocols (SMP), 2004.
12. Michael Freedman, Kobbi Nissim, and Benny Pinkas. Efficient private matching and set intersection. In Christian Cachin and Jan Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 1--19. Springer-Verlag, May 2004.
13. Ian Goldberg, David Wagner, and Eric Brewer. Privacy-enhancing technologies for the internet. In Proc. of 42nd IEEE Spring COMPCON. IEEE Computer Society Press, February 1997.
14. O. Goldreich. The Foundations of Cryptography --- Volume 2. Cambridge University Press, 2004.
15. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game -- a completeness theorem for protocols with honest majority. In 19th STOC, pages 218--229, 1987.
16. Javabdd - java binary decision diagram library. http://javabdd.sourceforge.net/.
17. R. M. Jensen and M. M. Veloso. Obdd-based universal planning for multiple synchronized agents in non-deterministic domains. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems (AIPS), 2000.
18. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3), 2002.
19. Yehuda Lindell and Benny Pinkas. A proof of Yao's protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175, 2004. http://eprint.iacr.org/2004/175.
20. B. Pinkas M. Naor and R. Sumner. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM conf. on Electronic Commerce, 1999.
21. Philip D. MacKenzie, Alina Oprea, and Michael K. Reiter. Automatic generation of two-party computations. In Proceedings of ACM Conference on Computer and Communications Security, 2003.
22. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay --- a secure two-party computation system. In Proceedings of the 13th Usenix Security Symposium, San Diego, CA, USA, August 2004.
23. Moni Naor and Benny Pinkas. Efficient oblivious transfer protocols. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA), pages 448--457, 2001.
24. D. M. Rind, I. S. Kohane, P. Szolovits, C. Safran, H. C. Chueh, and G. O. Barnett. Maintaining the confidentiality of medical records shared over the internet and the world wide web. Annals of Internal Medicine, 127(2), July 1997.
25. Joseph Turow. Americans and online privacy: The system is broken. Technical report, Annenberg Public Policy Center, June 2003.
26. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation (PLDI), 2004.
27. A.C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986.

Index Terms

• Security and privacy

  • Network security