Secure Computation on Floating Point Numbers

20th Annual Network and Distributed System Security Symposium, NDSS 2013

Volumn , Issue , 2013, Pages

  Aliasgari, Mehrdad ^a   Blanton, Marina ^a   Zhang, Yihua ^a   Steele, Aaron ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DIGITAL ARITHMETIC;

CLOUD-COMPUTING; COMPLEX OPERATIONS; DATATYPES; EXPONENTIATIONS; FLOATING POINT NUMBERS; FLOATING POINTS; POINT REPRESENTATIONS; REAL NUMBER; SECURE COMPUTATION; SQUARE-ROOT;

INFORMATION THEORY;

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

References (42)

1. Boost C++ Libraries. http://www.boost.org/.
2. GMP - The GNU Multiple Precision Arithmetic Library. http://gmplib. org.
3. IT cloud services user survey, pt. 2: Top benefits & challenges. http://blogs.idc.com/ie/?p=210.
4. OpenSSL: The Open Source toolkit for SSL/TLS. http://www.openssl.org/.
5. Sharemind. http://sharemind.cyber.ee/.
6. VIFF - the Virtual Ideal Functionality Framework. http://viff.dk/.
7. Sharemind 2.0 reaches a million operations per second, December 2010. http://sharemind.cyber.ee/news-blog/sharemind-20-reaches-a-million-operations-per-second.
8. SecureSCM Project Deliverable D9.2. http://pi1.informatik.uni-mannheim.de/index.php?pagecontent=site/Research.menu/SecureSCM.page, University of Mannheim, July 2009.
9. M. Atallah, M. Bykova, J. Li, K. Frikken, and M. Topkara. Private collaborative forecasting and benchmarking. In ACM Workshop on Privacy in the Electronic Society (WPES), pages 103-114, 2004.
10. G. Baker and P. Graves-Morris. Padé approximants. Cambridge University Press, 1995.
11. Z. Beerliova-Trubiniova and M. Hirt. Perfectly-secure MPC with linear communication complexity. In Theory of Cryptography Conference (TCC), pages 213-230, 2008.
12. M. Blanton. Achieving full security in privacy-preserving data mining. In IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT), pages 925-934, 2011.
13. P. Bunn and R. Ostrovsky. Secure two-party k-means clustering. In ACM Conference on Computer and Communications Security (CCS), pages 486-497, 2007.
14. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
15. O. Catrina and S. de Hoogh. Improved primitives for secure multiparty integer computation. In Security and Cryptography for Networks (SCN), pages 182-199, 2010.
16. O. Catrina and C. Dragulin. Multiparty computation of fixed-point multiplication and reciprocal. In International Workshop on Database and Expert Systems Application (DEXA), pages 107-111, 2009.
17. O. Catrina and A. Saxena. Secure computation with fixed-point numbers. In Financial Cryptography and Data Security (FC), pages 35-50, 2010. [18] R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Advances in Cryptology - EUROCRYPT, pages 316-334, 2000.
18. I. Damgård, M. Fitzi, E. Kiltz, J. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Theory of Cryptography Conference (TCC), volume 3876 of LNCS, pages 285-304, 2006.
19. I. Damgård, M. Geisler, and M. Krøigaard. Homomorphic encryption and secure comparison. International Journal of Applied Cryptography (IJACT), 1(1):22-31, 2008.
20. I. Damgård, Y. Ishai, and M. Krøigaard. Perfectly secure multiparty computation and the computational overhead of cryptography. In Advances in Cryptology - EUROCRYPT, pages 445-465, 2010.
21. I. Damgård, Y. Ishai, M. Krøigaard, J. Nielsen, and A. Smith. Scalable multiparty computation with nearly optimal work and resilience. In Advances in Cryptology - CRYPTO, pages 241-261, 2008.
22. P.-A. Fouque, J. Stern, and J.-G. Wackers. Cryptocomputing with rationals. In Financial Cryptography (FC), pages 136-146, 2002.
23. M. Franz, B. Deiseroth, K. Hamacher, S. Jha, S. Katzenbeisser, and H. Schröder. Secure computations on non-integer values. In IEEE International Workshop on Information Forensics and Security (WIFS), pages 1-6, 2010.
24. M. Franz and S. Katzenbeisser. Processing encrypted floating point signals. In ACM Workshop on Multimedia and Security (MMSEC'11), pages 103-108, 2011.
25. J. Garay, B. Shoenmakers, and J. Villegas. Practical and secure solutions for integer comparison. In Conference on Theory and Practice of Public Key Cryptography (PKC), pages 330-342, 2007.
26. R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In ACM Symposium on Principles of Distributed Computing (PODC), pages 101-111, 1998.
27. R.E. Goldschmidt. Applications of division by convergence. Master's thesis, M.I.T, 1964.
28. M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In Advances in Cryptology - CRYPTO, pages 101-118, 2001.
29. T. Hoens, M. Blanton, and N. Chawla. A private and reliable recommendation system using a social network. In IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT), pages 816-825, 2010.
30. Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols. In Network and Distributed System Security Symposium (NDSS), 2012.
31. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In International Conference on Cryptology and Network Security (CANS), pages 1-20, 2009.
32. B. Kreuter, A. Shelat, and C.H. Shen. Billion-gate secure computation with malicious adversaries. In USENIX Security Symposium, pages 285-300, 2012.
33. M. Liedel. Secure distributed computation of the square root and applications. In ISPEC, pages 277-288, 2012.
34. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2002.
35. T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit decomposition protocol. In Conference on Theory and Practice of Public Key Cryptography (PKC), pages 343-360, 2007.
36. K. Peng and F. Bao. An efficient range proof scheme. In IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT), pages 826-833, 2010.
37. T. Reistad. Multiparty comparison - An improved multiparty protocol for comparison of secret-shared values. In International Conference on Security and Cryptography (SECRYPT), pages 325-330, 2009.
38. T. Reistad and T. Toft. Linear, constant-rounds bit-decomposition. In International Conference on Information, Security and Cryptology (ICISC), pages 245-257, 2009.
39. S. Setty, V. Vu, N. Panpalia, B. Braun, A.J. Blumberg, and M. Walfish. Taking proof-based verified computation a few steps closer to practicality. In USENIX Security Symposium, pages 253-268, 2012.
40. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
41. T. Toft. Constant-rounds, almost-linear bit-decomposition of secret shared values. In Topics in Cryptology - CT-RSA, pages 357-371, 2009.
42. A. Yao. How to generate and exchange secrets. In IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.