{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:01:17Z","timestamp":1761580877198},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,15]],"date-time":"2011-04-15T00:00:00Z","timestamp":1302825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bus Inf Syst Eng"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s12599-011-0153-9","type":"journal-article","created":{"date-parts":[[2011,4,14]],"date-time":"2011-04-14T09:14:41Z","timestamp":1302772481000},"page":"135-143","source":"Crossref","is-referenced-by-count":12,"title":["Secure and Sustainable Benchmarking in Clouds"],"prefix":"10.1007","volume":"3","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,15]]},"reference":[{"key":"153_CR1","first-page":"53","volume-title":"Proc 25th ACM symposium on principles of distributed computing","author":"I Abraham","year":"2006","unstructured":"Abraham\u00a0I, Dolev\u00a0D, Gonen\u00a0R, Halpern\u00a0JY (2006) Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proc 25th ACM symposium on principles of distributed computing, pp\u00a053\u201362"},{"key":"153_CR2","first-page":"40","volume-title":"Proc Eurocrypt","author":"G Aggarwal","year":"2004","unstructured":"Aggarwal\u00a0G, Mishra\u00a0N, Pinkas\u00a0B (2004) Secure computation of the kth-ranked element. In: Proc Eurocrypt, pp 40\u201355"},{"key":"153_CR3","first-page":"103","volume-title":"Proc ACM workshop on privacy in an electronic society","author":"M Atallah","year":"2004","unstructured":"Atallah\u00a0M, Bykova\u00a0M, Li\u00a0J, Frikken\u00a0K, Topkara\u00a0M (2004) Private collaborative forecasting and benchmarking. In: Proc ACM workshop on privacy in an electronic society, pp 103\u2013114"},{"key":"153_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1145\/1455770.1455804","volume-title":"Proc 15th ACM conference on computer and communications security","author":"A Ben-David","year":"2008","unstructured":"Ben-David\u00a0A, Nisan\u00a0N, Pinkas\u00a0B (2008) FairplayMP: a system for secure multi-party computation. In: Proc 15th ACM conference on computer and communications security, pp 257\u2013266"},{"key":"153_CR5","unstructured":"Bennett\u00a0K, Bradley\u00a0P, Demiriz\u00a0A (2000) Constrained K-means clustering. Microsoft technical report"},{"key":"153_CR6","first-page":"1","volume-title":"Proc 20th ACM symposium on theory of computing","author":"M Ben-Or","year":"1988","unstructured":"Ben-Or\u00a0M, Goldwasser\u00a0S, Wigderson\u00a0A (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc 20th ACM symposium on theory of computing, pp 1\u201310"},{"key":"153_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Proc 13th international conference on financial cryptography and data security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft\u00a0P, Christensen\u00a0D, Damgard\u00a0I, Geisler\u00a0M, Jakobsen\u00a0T, Kroigaard\u00a0M, Nielsen\u00a0J, Nielsen\u00a0J, Nielsen\u00a0K, Pagter\u00a0J, Schwartzbach\u00a0M, Toft\u00a0T (2009) Secure multiparty computation goes live. In: Proc 13th international conference on financial cryptography and data security, pp 325\u2013343"},{"key":"153_CR8","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Proc 10th international conference on financial cryptography and data security","author":"P Bogetoft","year":"2006","unstructured":"Bogetoft\u00a0P, Damgard\u00a0I, Jakobsen\u00a0T, Nielsen\u00a0K, Pagter\u00a0J, Toft\u00a0T (2006) A practical implementation of secure auctions based on multiparty integer computation. In: Proc 10th international conference on financial cryptography and data security, pp 142\u2013147"},{"issue":"3","key":"153_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10726-005-6493-4","volume":"14","author":"P Bogetoft","year":"2005","unstructured":"Bogetoft\u00a0P, Nielsen\u00a0K (2005) Internet based benchmarking. Group Decision and Negotiation 14(3):195\u2013215","journal-title":"Group Decision and Negotiation"},{"key":"153_CR10","first-page":"280","volume-title":"Proc Eurocrypt","author":"R Cramer","year":"2001","unstructured":"Cramer\u00a0R, Damgard\u00a0I, Nielsen\u00a0J (2001) Multiparty computation from threshold homomorphic encryption. In: Proc Eurocrypt, pp 280\u2013299"},{"key":"153_CR11","volume-title":"Proc conference of travel and tourism research association","author":"J Crotts","year":"2006","unstructured":"Crotts\u00a0J, Pan\u00a0B, Dimitry\u00a0C (2006) Hospitality performance index: a case study of developing an internet-based competitive analysis and benchmarking tool for hospitality industry. In: Proc conference of travel and tourism research association"},{"issue":"1","key":"153_CR12","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1504\/IJACT.2008.017048","volume":"1","author":"I Damgard","year":"2008","unstructured":"Damgard\u00a0I, Geisler\u00a0M, Kroigard\u00a0M (2008) Homomorphic encryption and secure comparison. International Journal of Applied Cryptography 1(1):22\u201331","journal-title":"International Journal of Applied Cryptography"},{"key":"153_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Proc international conference on theory and practice of public-key cryptography","author":"I Damgard","year":"2001","unstructured":"Damgard\u00a0I, Jurik\u00a0M (2001) A generalisation, a simplification and some applications of pailliers probabilistic public-key system. In: Proc international conference on theory and practice of public-key cryptography, pp 119\u2013136"},{"key":"153_CR14","first-page":"72","volume-title":"Proc 4th international conference on financial cryptography and data security","author":"G Crescenzo Di","year":"2000","unstructured":"Di Crescenzo\u00a0G (2000) Private selective payment protocols. In: Proc 4th international conference on financial cryptography and data security, pp 72\u201389"},{"key":"153_CR15","first-page":"269","volume-title":"Proc 5th international conference on financial cryptography and data security","author":"G Crescenzo Di","year":"2001","unstructured":"Di Crescenzo\u00a0G (2001) Privacy for the stock market. In: Proc 5th international conference on financial cryptography and data security, pp 269\u2013288"},{"issue":"3\u20134","key":"153_CR16","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10660-010-9062-0","volume":"10","author":"M Eurich","year":"2010","unstructured":"Eurich\u00a0M, Oertel\u00a0N, Boutellier\u00a0R (2010) The impact of perceived privacy risks on organizations\u2019 willingness to share item-level event data across the supply chain. Electronic Commerce Research 10(3\u20134):423\u2013440","journal-title":"Electronic Commerce Research"},{"key":"153_CR17","first-page":"457","volume-title":"Proc RSA security cryptographer\u2019s track","author":"M Fischlin","year":"2001","unstructured":"Fischlin\u00a0M (2001) A cost-effective pay-per-multiplication comparison method for millionaires. In: Proc RSA security cryptographer\u2019s track, pp 457\u2013471"},{"key":"153_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"Proc 41st ACM symposium on theory of computing","author":"C Gentry","year":"2009","unstructured":"Gentry\u00a0C (2009) Fully homomorphic encryption using ideal lattices. In: Proc 41st ACM symposium on theory of computing, pp 169\u2013178"},{"key":"153_CR19","unstructured":"Goldreich\u00a0O (2002) Secure multi-party computation. http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html . Accessed 2011-02-07"},{"key":"153_CR20","first-page":"218","volume-title":"Proc 19th ACM symposium on theory of computing","author":"O Goldreich","year":"1987","unstructured":"Goldreich\u00a0O, Micali\u00a0S, Wigderson\u00a0A (1987) How to play any mental game. In: Proc 19th ACM symposium on theory of computing, pp 218\u2013229"},{"key":"153_CR21","first-page":"623","volume-title":"Proc 36th ACM symposium on theory of computing","author":"J Halpern","year":"2004","unstructured":"Halpern\u00a0J, Teague\u00a0V (2004) Rational secret sharing and multiparty computation: extended abstract. In: Proc 36th ACM symposium on theory of computing, pp 623\u2013632"},{"key":"153_CR22","first-page":"87","volume-title":"Proc 11th IEEE international EDOC conference","author":"F Kerschbaum","year":"2007","unstructured":"Kerschbaum\u00a0F (2007) Building a privacy-preserving benchmarking enterprise system. In: Proc 11th IEEE international EDOC conference, pp 87\u201396"},{"key":"153_CR23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-0-387-09699-5_2","volume-title":"Proc 23rd IFIP international information security conference","author":"F Kerschbaum","year":"2008","unstructured":"Kerschbaum\u00a0F (2008) Practical privacy-preserving benchmarking. In: Proc 23rd IFIP international information security conference, pp 17\u201331"},{"key":"153_CR24","first-page":"34","volume-title":"Proc 1st IEEE international conference on privacy, security, risk and trust","author":"F Kerschbaum","year":"2009","unstructured":"Kerschbaum\u00a0F (2009) Adapting privacy-preserving computation to the service provider model. In: Proc 1st IEEE international conference on privacy, security, risk and trust, pp 34\u201341"},{"key":"153_CR25","unstructured":"Kerschbaum\u00a0F (2010) A privacy-preserving benchmarking platform. Dissertation. Karlsruhe Institute of Technology"},{"key":"153_CR26","first-page":"2008","volume-title":"Proc 24th ACM symposium on applied computing","author":"F Kerschbaum","year":"2009","unstructured":"Kerschbaum\u00a0F, Dahlmeier\u00a0D, Schr\u00f6pfer\u00a0A, Biswas\u00a0D (2009) On the practical importance of communication complexity for secure multi-party computation protocols. In: Proc 24th ACM symposium on applied computing, pp 2008\u20132015"},{"key":"153_CR27","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/11766155_29","volume-title":"Proc international conference on emerging trends in information and communication security","author":"F Kerschbaum","year":"2006","unstructured":"Kerschbaum\u00a0F, Terzidis\u00a0O (2006) Filtering for private collaborative benchmarking. In: Proc international conference on emerging trends in information and communication security, pp 409\u2013422"},{"key":"153_CR28","first-page":"1","volume-title":"Proc 2nd international conference on collaborative computing","author":"J Li","year":"2006","unstructured":"Li\u00a0J, Atallah\u00a0M (2006) secure and private collaborative linear programming. In: Proc 2nd international conference on collaborative computing, pp 1\u20138"},{"key":"153_CR29","first-page":"287","volume-title":"Proc USENIX security symposium","author":"D Malkhi","year":"2004","unstructured":"Malkhi\u00a0D, Nisan\u00a0N, Pinkas\u00a0B, Sella\u00a0Y (2004) Fairplay\u2014a secure two-party computation system. In: Proc USENIX security symposium, pp 287\u2013302"},{"key":"153_CR30","first-page":"223","volume-title":"Proc Eurocrypt","author":"P Paillier","year":"1999","unstructured":"Paillier\u00a0P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Proc Eurocrypt, pp 223\u2013238"},{"issue":"1","key":"153_CR31","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/251007.251012","volume":"27","author":"L Rizzo","year":"1997","unstructured":"Rizzo\u00a0L (1997) Dummynet: a simple approach to the evaluation of network protocols. ACM Computer Communication Review 27(1):31\u201341","journal-title":"ACM Computer Communication Review"},{"key":"153_CR32","first-page":"1372","volume-title":"Proc conference on genetic and evolutionary computation","author":"J Sakuma","year":"2007","unstructured":"Sakuma\u00a0J, Kobayashi\u00a0S (2007) A genetic algorithm for privacy preserving combinatorial optimization. In: Proc conference on genetic and evolutionary computation, pp\u00a01372\u20131379"},{"key":"153_CR33","first-page":"554","volume-title":"Proc 40th IEEE symposium on foundations of computer science","author":"T Sander","year":"1999","unstructured":"Sander\u00a0T, Young\u00a0A, Yung\u00a0M (1999) Non-interactive crypto-computing for NC1. In: Proc 40th IEEE symposium on foundations of computer science, pp 554\u2013567"},{"key":"153_CR34","unstructured":"ShareMind (2010) http:\/\/research.cyber.ee\/sharemind\/ . Accessed 2011-02-07"},{"issue":"1\u20132","key":"153_CR35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2005.05.009","volume":"343","author":"Y Shoham","year":"2005","unstructured":"Shoham\u00a0Y, Tennenholtz\u00a0M (2005) Non-cooperative computation: boolean functions with correctness and exclusivity. Theoretical Computer Science 343(1\u20132):97\u2013113","journal-title":"Theoretical Computer Science"},{"key":"153_CR36","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-03549-4_6","volume-title":"Proc 13th international conference on financial cryptography and data security","author":"T Toft","year":"2009","unstructured":"Toft\u00a0T (2009) Solving linear programs using multiparty computation. In: Proc 13th international conference on financial cryptography and data security, pp 90\u2013107"},{"key":"153_CR37","unstructured":"VIFF (2010) http:\/\/www.viff.dk\/ . Accessed 2011-02-07"},{"key":"153_CR38","first-page":"162","volume-title":"Proc 27th IEEE symposium on foundations of computer science","author":"A Yao","year":"1986","unstructured":"Yao\u00a0A (1986) How to generate and exchange secrets. In: Proc 27th IEEE symposium on foundations of computer science, pp 162\u2013167"}],"container-title":["Business & Information Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12599-011-0153-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12599-011-0153-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12599-011-0153-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:03:55Z","timestamp":1559466235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12599-011-0153-9"}},"subtitle":["A Multi-Party Cloud Application with\u00a0an\u00a0Untrusted Service\u00a0Provider"],"short-title":[],"issued":{"date-parts":[[2011,4,15]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s12599-011-0153-9","relation":{},"ISSN":["1867-0202"],"issn-type":[{"value":"1867-0202","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,15]]}}}