Sharemind: A framework for fast privacy-preserving computations

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

Volumn 5283 LNCS, Issue , 2008, Pages 192-206

  Bogdanov, Dan ^a,b   Laur, Sven ^a   Willemson, Jan ^a,b  

^a UNIVERSITY OF TARTU   (Estonia)

^b CYBERNETICA AS   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; SECURITY OF DATA; SECURITY SYSTEMS;

COMPUTING TECHNIQUES; GENERAL-PURPOSE COMPUTATIONS; MALICIOUS PARTICIPANT; MULTIPARTY COMPUTATION; PRIVACY PRESERVATION; PRIVACY PRESERVING; PRIVACY PRESERVING COMPUTATION; SECRET SHARING SCHEMES;

COMPUTATIONAL EFFICIENCY;

EID: 57049188348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88313-5_13     Document Type: Conference Paper

References (18)

1. Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proc. of PODS 2001. pp. 247-255 (2001)
2. Agrawal, R., Srikant, R.: Privacy-preserving data mining. SIGMOD Rec. 29(2), 439-450 (2000)
3. Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology 4(2), 75-122 ( 1991)
4. Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proc. of PODC 1994, pp. 183-192 (1994)
5. Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. Cryptology ePrint Archive, Report 2008/289 (2008)
6. Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A practical implementation of secure auctions based on multiparty integer computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142-147. Springer, Heidelberg (2006)
7. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
8. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of FOCS 2001, pp. 136-145 (2001)
9. Cramer, R., Fehr, S., Ishai, Y. Kushilevitz, E.: Efficient multi-party computation over rings. In: Proc. of EUROCRYPT 2003. LNCS, vol. 4107, pp. 596-613 (2003)
10. Damgård. I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006)
11. Dodis, Y. Micali, S.: Parallel reducibility for information-theoretically secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 74-92. Springer, Heidelberg (2000)
12. Du, W., Atallah, M.J.: Protocols for secure remote database access with approximate matching. In: ACMCCS 2000, Athens, Greece, November 1-4 (2000)
13. Evfimievski, A.V., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. of KDD 2002, pp. 217-228 (2002)
14. Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multi-party computation. Journal of Cryptology 13(1), 31-60 (2000)
15. Lindell, Y., Pinkas, B.: A proof of Yao's protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175 (2004)
16. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Proc. of USENIX Security Symposium, pp. 287-302 (2004)
17. The SHAREMIND project web page (2007), http://sharemind.cs.ut.ee
18. Yang, Z., Wright, R.N., Subramaniam, H.: Experimental analysis of a privacy-preserving scalar product protocol. Comput. Syst. Sci. Eng. 21(1) (2006)