{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T17:41:51Z","timestamp":1761154911434,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346401"},{"type":"electronic","value":"9783540346425"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11766155_29","type":"book-chapter","created":{"date-parts":[[2006,5,31]],"date-time":"2006-05-31T15:35:00Z","timestamp":1149089700000},"page":"409-422","source":"Crossref","is-referenced-by-count":26,"title":["Filtering for Private Collaborative Benchmarking"],"prefix":"10.1007","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis","family":"Terzidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure Computation of the kth-Ranked Element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"29_CR2","unstructured":"Atallah, M., Elmongui, H., Deshpande, V., Schwarz, L.: Secure supply-chain protocols. In: Proceedings of the 5th IEEE International Conference on Electronic Commerce (2003)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Atallah, M., Kerschbaum, F., Du, W.: Secure and Private Sequence Comparisons. In: Proceedings of the 2nd annual Workshop on Privacy in the Electronic Society (2003)","DOI":"10.1145\/1005140.1005147"},{"key":"29_CR4","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)"},{"key":"29_CR5","unstructured":"Bahr, F., Boehm, M., Franke, J., Kleinjung, T.: RSA200 (2005), Available at : \n                    \n                      http:\/\/www.crypto-world.com\/announcements\/rsa200.txt"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th annual ACM symposium on Theory of computing (1988)","DOI":"10.1145\/62212.62213"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Bykova, M., Atallah, M., Li, J., Frikken, K., Topkara, M.: Private Collaborative Forecasting and Benchmarking. In: Proceedings of the 3rd annual Workshop on Privacy in the Electronic Society (2004)","DOI":"10.1145\/1029179.1029204"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security (1999)","DOI":"10.1145\/319709.319726"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024(2) (1981)","DOI":"10.1145\/358549.358563"},{"key":"29_CR10","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. RSA Security Cryptographer\u2019s Track (2001)","DOI":"10.1007\/3-540-45353-9_33"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Frikken, K., Atallah, M.: Privacy Preserving Electronic Surveillance. In: Proceedings of the 2nd annual Workshop on Privacy in the Electronic Society (2003)","DOI":"10.1145\/1005140.1005148"},{"key":"29_CR13","unstructured":"Goldreich, O.: Secure Multi-party Computation (2002), Available at : \n                    \n                      http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th annual ACM conference on Theory of computing (1987)","DOI":"10.1145\/28395.28420"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S.: Multi party computations: past and present. In: Proceedings of the 16th annual ACM symposium on Principles of distributed computing (1997)","DOI":"10.1145\/259380.259405"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and Systems Science\u00a028(2) (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"29_CR17","volume-title":"Java Language Specification","author":"J. Gosling","year":"2000","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G.: Java Language Specification, 2nd edn. Addison-Wesley, Reading (2000)","edition":"2"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 162. Springer, Heidelberg (2000)"},{"key":"29_CR20","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - A Secure Two-party Computation System. In: Proceedings of the 13th USENIX Security Symposium (2004)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A New Public-Key Cryptosystem Based on Higher Residues. In: Proceedings of the 5th ACM Conference on Computer and Communications Security (1998)","DOI":"10.1145\/288090.288106"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"29_CR23","unstructured":"Rabin, O.: How to exchange secrets by oblivious transfer. Technical Memo TR\u201381, Aiken Computation Laboratory (1981)"},{"key":"29_CR24","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography, 2nd edn. John Wiley & Sons, Chichester (1996)","edition":"2"},{"key":"29_CR25","unstructured":"Silaghi, M.: Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In: Proceedings of the 4th International Workshop on Distributed Constraint Reasoning (2003)"},{"key":"29_CR26","unstructured":"Silaghi, M.: Meeting scheduling system guaranteeing n\/2-privacy and resistant to statistical analysis (applicable to any DisCSP). In: Proceedings of the IEEE\/WIC\/ACM International Conference on Web Intelligence (2004)"},{"key":"29_CR27","unstructured":"Sun Microsystems. J2SE 1.4.2 SDK (2005), Available at : \n                    \n                      http:\/\/java.sun.com\/j2se\/1.4.2\/"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second Generation Onion Router. In: Proceedings of USENIX Security Symposium (2004)","DOI":"10.21236\/ADA465464"},{"key":"29_CR29","unstructured":"Sloane, N.: The On-Line Encyclopedia of Integer Sequences (2005) Available at : \n                    \n                      http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for Secure Computations. In: Proceedings of the annual IEEE Symposium on Foundations of Computer Science, vol.\u00a023 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Emerging Trends in Information and Communication Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11766155_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:21:13Z","timestamp":1558272073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11766155_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346401","9783540346425"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11766155_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}