{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:28:24Z","timestamp":1725560904833},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208273"},{"type":"electronic","value":"9783540245919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24591-9_19","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:36:56Z","timestamp":1280374616000},"page":"244-256","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Implementation of Relative Bid Privacy in Sealed-Bid Auction"],"prefix":"10.1007","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[]},{"given":"Kapalee","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation net-works. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"Public Key Cryptography 2001","author":"M. Abe","year":"2001","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 317\u2013324. Springer, Heidelberg (2001)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Abe, M., Suzuki, K.: M+1-st price auction using homomorphic encryption. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 115\u2013124. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45664-3_8"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Proceedings of the 9th ACM conference on Computer and communications security, pp. 68\u201377 (2002)","DOI":"10.1145\/586110.586121"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Brandt, F.: Cryptographic protocols for secure second-price auctions (2001), Available at http:\/\/wwwbrauer.in.tum.de\/~brandtf\/papers\/cia2001.pdf","DOI":"10.1007\/3-540-44799-7_16"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return address and digital pseudonym. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-45439-X_28","volume-title":"Information Security","author":"K. Chida","year":"2001","unstructured":"Chida, K., Kobayashi, K., Morita, H.: Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 408\u2013419. Springer, Heidelberg (2001)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"5","author":"M.K. Franklin","year":"1996","unstructured":"Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction service. IEEE Transactions on Software Enginerring\u00a05, 302\u2013312 (1996)","journal-title":"IEEE Transactions on Software Enginerring"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a01592, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"19_CR11","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":"2003","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 (2003)"},{"key":"19_CR12","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomizsed partial checking. In: Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, pp. 339\u2013353. USENIX (2002)"},{"key":"19_CR13","first-page":"284","volume-title":"Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation","author":"A. Juels","year":"2001","unstructured":"Juels, A., Jakobsson, M.: An optimally robust hybrid mix network. In: Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation, pp. 284\u2013292. ACM, New York (2001)"},{"key":"19_CR14","unstructured":"Kikuchi, H., Harkavy, M., Tygar, J.D.: Multi-round anonymous auction. In: Proceedings of the First IEEE Workshop on Dependable and Real-Time ECommerce Systems, June 1998, pp. 62\u201369 (1998)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","first-page":"291","volume-title":"Financial Cryptography","author":"H. Kikuchi","year":"2001","unstructured":"Kikuchi, H. (m+1)st-price auction. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 291\u2013298. Springer, Heidelberg (2001)"},{"key":"19_CR16","first-page":"307","volume-title":"Proc. of International Workshop on Next Generation Internet (NGITA 2000)","author":"H. Kikuchi","year":"2000","unstructured":"Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In: Proc. of International Workshop on Next Generation Internet (NGITA 2000), July 2000, pp. 307\u2013312. IEEE, Los Alamitos (2000)"},{"key":"19_CR17","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 thresh-old trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, Springer, Heidelberg (2003)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-45247-8_14","volume-title":"Information Security and Cryptology - ICISC 2000","author":"Y. Mu","year":"2000","unstructured":"Mu, Y., Varadharajan, V.: An internet anonymous auction scheme. In: Won, D. (ed.) ICISC 2000. LNCS, vol.\u00a02015, pp. 171\u2013182. Springer, Heidelberg (2000)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy perserving auctions and mechanism design (1999), Available from http:\/\/www.tml.hut.fi\/~helger\/crypto\/link\/protocols\/auctions.html","DOI":"10.1145\/336992.337028"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security 2001, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Information and Communications Security","author":"W. Ogata","year":"2000","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 440\u2013444. Springer, Heidelberg (2000)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-44448-3_14","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Ohkubo","year":"2000","unstructured":"Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 178\u2013191. Springer, Heidelberg (2000)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography","author":"K. Omote","year":"2002","unstructured":"Omote, K., Miyaji, A.: A second-price sealed-bid auction with the discriminant of the p-th root. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, Springer, Heidelberg (2002)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-46416-6_20","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 221\u2013242. Springer, Heidelberg (1991)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Public Key Cryptography","author":"K. Sako","year":"2000","unstructured":"Sako, K.: An auction scheme which hides the bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01880, pp. 422\u2013432. Springer, Heidelberg (2000)"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme\u2013a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"19_CR28","first-page":"180","volume-title":"Proc. International Workshop on Cryptographic Techniques and E-Commerce","author":"K. Sakurai","year":"1999","unstructured":"Sakurai, K., Miyazaki, S.: A bulletin-board based digital auction scheme with bidding down strategy -towards anonymous electronic bidding without anonymous channels nor trusted centers. In: Proc. International Workshop on Cryptographic Techniques and E-Commerce, pp. 180\u2013187. City University of Hong Kong Press, Hong Kong (1999)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45247-8_15","volume-title":"Information Security and Cryptology - ICISC 2000","author":"K. Suzuki","year":"2000","unstructured":"Suzuki, K., Kobayashi, K., Morita, H.: Efficient sealed-bid auction using hash chain. In: Won, D. (ed.) ICISC 2000. LNCS, vol.\u00a02015, pp. 183\u2013191. Springer, Heidelberg (2000)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/10718964_34","volume-title":"Information Security and Privacy","author":"K. Viswanathan","year":"2000","unstructured":"Viswanathan, K., Boyd, C., Dawson, E.: A three phased schema for sealed bid auction system design. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol.\u00a01841, pp. 412\u2013426. Springer, Heidelberg (2000)"},{"key":"19_CR31","first-page":"80","volume-title":"STOC 2000","author":"Y. Watanabe","year":"2000","unstructured":"Watanabe, Y., Imai, H.: Reducing the round complexity of a sealed-bid auction protocol with an off-line ttp. In: STOC 2000, pp. 80\u201386. ACM, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24591-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:41:04Z","timestamp":1559331664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24591-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208273","9783540245919"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24591-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}