A multi-party protocol for privacy-preserving cooperative linear systems of equations

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

Volumn 9024, Issue , 2015, Pages 161-172

  Dagdelen, Özgür ^a   Venturi, Daniele ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; LINEAR SYSTEMS; SECURITY OF DATA;

LINEAR SYSTEM OF EQUATIONS; LINEAR SYSTEMS OF EQUATIONS; MULTI-PARTY PROTOCOLS; PRIVACY PRESERVING; SIMULATION-BASED SECURITY;

DATA PRIVACY;

EID: 84952836682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-21356-9_11     Document Type: Conference Paper

References (38)

1. Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: ACM Conference on Computer and Communications Security, pp. 535-548 (2013).
2. Ateniese, G., Dagdelen, Ö., Damgård, I., Venturi, D.: Entangled cloud storage. IACR Cryptology ePrint Arch. 2012, 511 (2012).
3. Bellare, M., Hoang, V. T., Rogaway, P.: Foundations of garbled circuits. In: ACM Conference on Computer and Communications Security, pp. 784-796 (2012).
4. Bendlin, R., Damgård, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K. G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169-188. Springer, Heidelberg (2011).
5. Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., Vinayagamurthy, D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P. Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533-556. Springer, Heidelberg (2014).
6. Brassard, G., Crépeau, C., Robert, J. M.: All-or-nothing disclosure of secrets. In: Odlyzko, A. M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234-238. Springer, Heidelberg (1987).
7. Dagdelen, Ö., Mohassel, P., Venturi, D.: Rate-limited secure function evaluation: definitions and constructions. In: Public Key Cryptography, pp. 461-478 (2013).
8. Dagdelen, Ö., Venturi, D.: A multi-party protocol for privacy-preserving cooperative linear system of equations. In: BalkanCryptSec (2014).
9. Damgård, I. B., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501-520. Springer, Heidelberg (2006).
10. Damgård, I., Ishai, Y., Krøigaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445-465. Springer, Heidelberg (2010).
11. Damgård, I., Ishai, Y., Krøigaard, M., Nielsen, J. B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241-261. Springer, Heidelberg (2008).
12. Damgård, I. B., Nielsen, J. B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572-590. Springer, Heidelberg (2007).
13. Damgård, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643-662. Springer, Heidelberg (2012).
14. Damgrd, I., Nielsen, J. B., Orlandi, C.: Essentially optimal universally composable oblivious transfer. In: Cryptology ePrint Archive, Report 2008/220 (2008).
15. Du, W., Atallah, M. J.: Privacy-preserving cooperative scientific computations. In: CSFW, pp. 273-294 (2001).
16. Du, W., Zhan, J. Z.: A practical approach to solve secure multi-party computation problems. In: Proceedings of the 2002 Workshop on New Security Paradigms, Virginia Beach, VA, USA, September 23-26, 2002, pp. 127-135 (2002).
17. Dubovitskaya, M., Scafuro, A., Visconti, I.: On efficient non-interactive oblivious transfer with tamper-proof hardware. In: Cryptology ePrint Archive, Report 2010/509 (2010).
18. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647 (1985).
19. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229 (1987).
20. Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. IACR Cryptology ePrint Arch. 2015, 004 (2015).
21. Hazay, C.: Lindell, yehuda: efficient oblivious polynomial evaluation with simulation-based security. IACR Cryptology ePrint Arch. 2009, 459 (2009).
22. Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols-Techniques and Constructions. Information Security and Cryptography. Springer, Heidelberg (2010).
23. Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium (2011).
24. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003).
25. Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR Cryptology ePrint Arch. 2011, 272 (2011).
26. Kang, J.-S., Hong, D.: A practical privacy-preserving cooperative computation protocol without oblivious transfer for linear systems of equations. JIPS 3(1), 21-25 (2007).
27. Mishra, D. K., Trivedi, P., Shukla, S.: A glance at secure multiparty computation for privacy preserving data mining. Int. J. Comput. Sci. Eng. 1(3), 171-175 (2009).
28. Mohassel, P., Riva, B.: Garbled circuits checking garbled circuits: more efficient and secure two-party computation. In: Canetti, R., Garay, J. A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 36-53. Springer, Heidelberg (2013).
29. Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC pp. 245-254 (1999).
30. Nielsen, J. B., Nordholt, P. S., Orlandi, C., Burra, S. S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681-700. Springer, Heidelberg (2012).
31. Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554-571. Springer, Heidelberg (2008).
32. Michael O. Rabin. How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005/187, 2005.
33. Troncoso-Pastoriza, J. R., Comesana, P., Pérez-González, F.: Secure direct and iterative protocols for solving systems of linear equations. In: Proceedings of the First International Workshop Signal Processing in the Encrypted Domain (SPEED), pp. 122-141 (2009).
34. Tzeng, W.-G.: Efficient 1-out-n oblivious transfer schemes. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 159-171. Springer, Heidelberg (2002).
35. Wu, N., Zhang, J., Ning, L.: Discovering multivariate linear relationship securely. In: Proceedings from the Sixth Annual IEEE SMC, Information Assurance Workshop, IAW 2005, pp. 436-437 (2005).
36. Yang, X., Yu, Z., Kang, B.: Privacy-preserving cooperative linear system of equations protocol and its application. In: WiCOM, pp. 1-4 (2008).
37. Yao, A. C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160-164 (1982).
38. Yao, A. C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986).