{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:05Z","timestamp":1749825845402},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462552"},{"type":"electronic","value":"9783540462569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889663_10","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T10:12:37Z","timestamp":1160388757000},"page":"142-147","source":"Crossref","is-referenced-by-count":72,"title":["A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation"],"prefix":"10.1007","author":[{"given":"Peter","family":"Bogetoft","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Jakobsen","sequence":"additional","affiliation":[]},{"given":"Kurt","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Pagter","sequence":"additional","affiliation":[]},{"given":"Tomas","family":"Toft","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"10_CR2","unstructured":"Bogetoft, P., Nielsen, K.: Work in progress (2005)"},{"key":"10_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-44799-7_16","volume-title":"Cooperative Information Agents V","author":"F. Brandt","year":"2001","unstructured":"Brandt, F.: Cryptographic protocols for secure second-price auctions. In: Klusch, M., Zambonelli, F. (eds.) CIA 2001. LNCS (LNAI), vol.\u00a02182, p. 154. Springer, Heidelberg (2001)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"crossref","DOI":"10.1007\/b106453","volume-title":"Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC)","author":"F. Brandt","year":"2005","unstructured":"Brandt, F., Sandholm, T.: Efficient privacy-preserving protocols for multi-unit auctions. In: Patrick, A., Yung, M. (eds.) Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC). Lecture Notes in Computer Science (LNCS), Springer, Heidelberg (2005)"},{"key":"10_CR5","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols (2005), \n                    \n                      http:\/\/eprint.iacr.org\/2000\/067"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Proceedings of the Second Theory of Cryptography Conference, pp. 342\u2013362 (2005)","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"10_CR7","unstructured":"Damg\u00e5rd, I., Toft, T.: Work in progress (2005)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"I.B. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I.B., Cramer, R., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"10_CR9","unstructured":"Feigenbaum, J., Pinkas, B., Ryger, R. S., Jain, F. S.: Secure Computation of Surveys. In: EU Workshop on Secure Multiparty Protocols (2004)"},{"key":"10_CR10","first-page":"2","volume-title":"Proc. IEEE Symp. on Security and Privacy","author":"M. Franklin","year":"1995","unstructured":"Franklin, M., Reiter, M.: The Design and Implementation of a Secure Auction Service. In: Proc. IEEE Symp. on Security and Privacy, Oakland, Ca, pp. 2\u201314. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"10_CR11","unstructured":"From, S.L., Jakobsen, T.: Secure Multi-Party Computation on Integers. Master\u2019s thesis, Department of Computer Science, University of Aarhus. In preparation (2006)"},{"key":"10_CR12","first-page":"218","volume-title":"19th Symp. on Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental gamer or a completeness theorem for protocols with honest majority. In: 19th Symp. on Theory of Computing (STOC), pp. 218\u2013229. ACM, New York (1987)"},{"key":"10_CR13","unstructured":"Damg\u00e5rd, I., Fitzi, N., Nielsen, J., Toft, T.: How to split a shared secret into shared bits in constant-round. The Eprint archive, nr. 2005\/140 (2005), \n                    \n                      www.iacr.org"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1111\/1467-6419.00083","volume":"13","author":"P. Klemperer","year":"1999","unstructured":"Klemperer, P.: Auction theory: A guide to the literature. Journal of Economic Survey\u00a013(3), 227\u2013286 (1999)","journal-title":"Journal of Economic Survey"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, Springer, Heidelberg (2003)"},{"key":"10_CR16","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - A Secure Two-Party Computation System. In: Proceedings of the 13th USENIX Security Symposium, pp. 287\u2013302 (2004)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/336992.337028","volume-title":"1st ACM Conf. on Electronic Commerce","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: 1st ACM Conf. on Electronic Commerce, pp. 129\u2013139. ACM, New York (1999)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0165-1765(94)00641-E","volume":"48","author":"D. Nautz","year":"1995","unstructured":"Nautz, D.: Optimal bidding in multi-unit auctions with many bidders. Economics Letters\u00a048, 301\u2013306 (1995)","journal-title":"Economics Letters"},{"issue":"11","key":"10_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"10_CR20","unstructured":"Toft, T.: Secure integer computation with application in economics. Progress Report, available from author (2005), tomas@daimi.au.dk"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security and Cryptology - ICISC 2003","author":"C. Wang","year":"2004","unstructured":"Wang, C., Leung, H.F., Wang, Y.: Secure double auction protocols with full privacy protection. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889663_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T08:27:37Z","timestamp":1552292857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889663_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462552","9783540462569"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11889663_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}