Practical privacy-preserving benchmarking

IFIP International Federation for Information Processing

Volumn 278, Issue , 2008, Pages 17-31

  Kerschbaum, Florian ^a  

^a SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; ECONOMIC AND SOCIAL EFFECTS; HISTORIC PRESERVATION; SECURITY OF DATA; STATISTICS;

BENCHMARKING PLATFORMS; BENCHMARKING SYSTEM; CENTRAL-ENTITY; PERFORMANCE MEASURE; PRIVACY PRESERVING; PROBLEM SIZE; TRADE OFF;

BENCHMARKING;

EID: 48249134708     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09699-5_2     Document Type: Conference Paper

References (34)

1. G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the kth-ranked element. Proceedings of EUROCRYPT, 2004.
2. M. Atallah, M. Bykova, J. Li, K. Frikken, and M. Topkara. Private collaborative forecasting and benchmarking. Proceedings of the ACM workshop on Privacy in the electronic society, 2004.
3. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
4. M. Ben-Or, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM symposium on theory of computing, 1988.
5. P. Bogetoft, I. Damgard, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. Proceedings of Financial Cryptography, 2006.
6. I. Damgard, R. Cramer, and J. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption. Proceedings of EUROCRYPT, 2001.
7. I. Damgard, and Y. Ishai Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. Proceedings of CRYPTO, 2005.
8. I. Damgard, and M. Jurik. A Generalisation, a Simplification and some Applications of Pailliers Probabilistic Public-Key System. Proceedings of International Conference on Theory and Practice of Public-Key Cryptography, 2001.
9. G. Di Crescenzo. Private Selective Payment Protocols. Proceedings of Financial Cryptography, 2000.
10. G. Di Crescenzo. Privacy for the Stock Market. Proceedings of Financial Cryptography, 2001.
11. W. Du, and M. Atallah. Privacy-preserving Cooperative Statistical Analysis. Proceedings of the 17th Annual Computer Security Applications Conference, 2001.
12. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM 28(6), 1985.
13. J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean. Secure Computation of Surveys. Proceedings of the EU Workshop on Secure Multiparty Protocols, 2004.
14. O. Goldreich. Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il/~oded/pp.html, 2002.
15. O. Goldreich. The Foundations of Cryptography Vol. 2. Cambridge University Press, 2004.
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on theory of computing, 1987.
17. S. Goldwasser. Multi party computations: Past and present. Proceedings of the 16th ACM symposium on principles of distributed computing, 1997.
18. A. Juels, and M. Szydlo. A two-server, sealed-bid auction protocol. Proceedings of the 6th Conference on Financial Cryptography, 2002.
19. E. Karnin, J. Green and M. Hellman. On Secret Sharing Systems. IEEE Transactions on Information Theory 29(1) 1983.
20. F. Kerschbaum, and O. Terzidis. Filtering for Private Collaborative Benchmarking. Proceedings of the International Conference on Emerging Trends in Information and Communication Security, 2006.
21. E. Kiltz, G. Leander, and J. Malone-Lee. Secure Computation of the Mean and Related Statistics. Proceedings of Theory of Cryptography Conference, 2005.
22. H. Lipmaa, N. Asokan, and V. Niemi. Secure Vickrey auctions without threshold trust. Proceedings of the 6th Conference on Financial Cryptography, 2002.
23. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-party Computation System. Proceedings of the USENIX security symposium, 2004.
24. D. Naccache, and J. Stern. A New Public-Key Cryptosystem Based on Higher Residues. Proceedings of the ACM Conference on Computer and Communications Security, 1998.
25. M. Naor, and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of the symposium on data structures and algorithms, 2001.
26. M. Naor, B. Pinkas and R. Sumner. Privacy Preserving Auctions and Mechanism Design. Proceedings of the 1st ACM Conference on Electronic Commerce, 1999.
27. T. Okamoto, and S. Uchiyama. A new public-key cryptosystem as secure as factoring. Proceedings of EUROCRYPT, 1998.
28. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proceedings of EUROCRYPT, 1999.
29. B. Preneel. Cryptographic hash functions. European Transactions on Telecommunications 5(4), 1994.
30. M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, 1981.
31. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 1978.
32. L. Rizzo. Dummynet: A simple approach to the evaluation of network protocols. ACM Computer Communication Review 27(1), 1997.
33. H. Subramaniam, R. Wright, and Z. Yang. Experimental Analysis of Privacy-Preserving Statistics Computation. Proceedings of the Workshop on Secure Data Management, 2004.
34. A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on foundations of computer science 23, 1982.