{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:43Z","timestamp":1725515203530},"publisher-location":"Boston, MA","reference-count":34,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096988"},{"type":"electronic","value":"9780387096995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09699-5_2","type":"book-chapter","created":{"date-parts":[[2008,7,16]],"date-time":"2008-07-16T14:12:54Z","timestamp":1216217574000},"page":"17-31","source":"Crossref","is-referenced-by-count":18,"title":["Practical Privacy-Preserving Benchmarking"],"prefix":"10.1007","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the kth-ranked element. Proceedings of EUROCRYPT, 2004.","DOI":"10.1007\/978-3-540-24676-3_3"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/1029179.1029204"},{"key":"2_CR3","unstructured":"J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/62212.62213"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/11889663_10"},{"key":"2_CR6","unstructured":"I. Damgard, R. Cramer, and J. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption. Proceedings of EUROCRYPT, 2001."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"I. Damgard, and Y. Ishai Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. Proceedings of CRYPTO, 2005.","DOI":"10.1007\/11535218_23"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-44586-2_9"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo. Private Selective Payment Protocols. Proceedings of Financial Cryptography, 2000.","DOI":"10.1007\/3-540-45472-1_6"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo. Privacy for the Stock Market. Proceedings of Financial Cryptography, 2001.","DOI":"10.1007\/3-540-46088-8_22"},{"key":"2_CR11","unstructured":"W. Du, and M. Atallah. Privacy-preserving Cooperative Statistical Analysis. Proceedings of the 17th Annual Computer Security Applications Conference, 2001."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM 28(6), 1985.","DOI":"10.1145\/3812.3818"},{"key":"2_CR13","unstructured":"J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean. Secure Computation of Surveys. Proceedings of the EU Workshop on Secure Multiparty Protocols, 2004."},{"key":"2_CR14","unstructured":"O. Goldreich. Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il\/\u02dcoded\/pp.html, 2002."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich. The Foundations of Cryptography Vol. 2. Cambridge University Press, 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A.Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on theory of computing, 1987.","DOI":"10.1145\/28395.28420"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"S. Goldwasser. Multi party computations: past and present. Proceedings of the 16th ACM symposium on principles of distributed computing, 1997.","DOI":"10.1145\/259380.259405"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"A. Juels, and M. Szydlo. A two-server, sealed-bid auction protocol. Proceedings of the 6th Conference on Financial Cryptography, 2002.","DOI":"10.1007\/3-540-36504-4_6"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"E. Karnin, J. Green and M. Hellman. On Secret Sharing Systems. IEEE Tranactions on Information Theory 29(1), 1983.","DOI":"10.1109\/TIT.1983.1056621"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"F. Kerschbaum, and O. Terzidis. Filtering for Private Collaborative Benchmarking. Proceedings of the International Conference on Emerging Trends in Information and Communication Security, 2006.","DOI":"10.1007\/11766155_29"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"E. Kiltz, G. Leander, and J. Malone-Lee. Secure Computation of the Mean and Related Statistics. Proceedings of Theory of Cryptography Conference, 2005.","DOI":"10.1007\/978-3-540-30576-7_16"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"H. Lipmaa, N. Asokan, and V. Niemi. Secure Vickrey auctions without threshold trust. Proceedings of the 6th Conference on Financial Cryptography, 2002.","DOI":"10.1007\/3-540-36504-4_7"},{"key":"2_CR23","unstructured":"D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-party Computation System. Proceedings of the USENIX security symposium, 2004."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/288090.288106"},{"key":"2_CR25","unstructured":"M. Naor, and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of the symposium on data structures and algorithms, 2001."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas and R. Sumner. Privacy Preserving Auctions and Mechanism Design. Proceedings of the 1st ACM Conference on Electronic Commerce, 1999.","DOI":"10.1145\/336992.337028"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"T. Okamoto, and S. Uchiyama. A new public-key cryptosystem as secure as factoring. Proceedings of EUROCRYPT, 1998.","DOI":"10.1007\/BFb0054135"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proceedings of EUROCRYPT, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"B. Preneel. Cryptographic hash functions. European Transactions on Telecommunications 5(4), 1994.","DOI":"10.1002\/ett.4460050406"},{"key":"2_CR30","unstructured":"M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR\u201381, Aiken Computation Laboratory, 1981."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir, and L. Adleman. AMethod for Obtaining Digital Signatures and Public- Key Cryptosystems. Communications of the ACM 21(2), 1978.","DOI":"10.1145\/359340.359342"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"L. Rizzo. Dummynet: a simple approach to the evaluation of network protocols. ACM Computer Communication Review 27(1), 1997.","DOI":"10.1145\/251007.251012"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"H. Subramaniam, R. Wright, and Z. Yang. Experimental Analysis of Privacy-Preserving Statistics Computation. Proceedings of the Workshop on Secure Data Management, 2004.","DOI":"10.1007\/978-3-540-30073-1_5"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on foundations of computer science 23, 1982. Enhancing Privacy in Remote Data Classification","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["IFIP \u2013 The International Federation for Information Processing","Proceedings of The Ifip Tc 11 23rd International Information Security Conference"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09699-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:45:37Z","timestamp":1619559937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09699-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096988","9780387096995"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09699-5_2","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}