{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:09:06Z","timestamp":1725487746134},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426622"},{"type":"electronic","value":"9783540454397"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45439-x_28","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T13:44:53Z","timestamp":1185025493000},"page":"408-419","source":"Crossref","is-referenced-by-count":22,"title":["Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison"],"prefix":"10.1007","author":[{"given":"Koji","family":"Chida","sequence":"first","affiliation":[]},{"given":"Kunio","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Hikaru","family":"Morita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"The Decision Diffie-Hellman Problem","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, \u201cThe Decision Diffie-Hellman Problem,\u201d Proc. of ANTS-III, LNCS 1423, Springer-Verlag, pp. 48\u201363, 1998."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"C. Cachin, \u201cEfficient Private Bidding and Auctions with an Oblivious Third Party,\u201d Proc. of ACM-CCS\u201999, 1999.","DOI":"10.1145\/319709.319726"},{"issue":"6","key":"28_CR3","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNewDirections in Cryptography,\u201d IEEE Trans. on Information Theory, IT-22, 6, pp. 644\u2013654, 1976.","journal-title":"IEEE Trans. on Information Theory"},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-68697-5_15","volume-title":"Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers","author":"M. Jakobsson","year":"1996","unstructured":"M. Jakobsson, M. Yung, \u201cProving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers,\u201d Proc. of CRYPTO 96, LNCS 1109, Springer-Verlag, pp. pp. 186\u2013200, 1996."},{"issue":"4","key":"28_CR5","first-page":"769","volume":"E82-D","author":"H. Kikuchi","year":"1999","unstructured":"H. Kikuchi, M. Harkavy and D. Tygar, \u201cMulti-Round Anonymous Auction Protocols,\u201d IEICE Trans. Inf. & Syst., Vol. E82-D, No.4, pp. 769\u2013777, 1999.","journal-title":"IEICE Trans. Inf. & Syst."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, \u201cOblivious Transfer and Polynomial Evaluation,\u201d Proc. of 31st STOC, pp. 245\u2013254, 1999.","DOI":"10.1145\/301250.301312"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas and R. Sumner, \u201cPrivacy Preserving Auctions and Mechanism Design,\u201d ACM Workshop on E-Commerce, 1999.","DOI":"10.1145\/336992.337028"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, \u201cNumber-Theoretic Constructions of Efficient Pseudo-Random Functions,\u201d Extended abstract in: Proc. of 38th FOCS, pp. 458\u2013467, 1997.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"28_CR9","series-title":"Lect Notes Comput Sci","first-page":"69","volume-title":"PayWord and MicroMint-Two simple micropayment schemes","author":"R. L. Rivest","year":"1996","unstructured":"R. L. Rivest and A. Shamir, \u201cPayWord and MicroMint-Two simple micropayment schemes,\u201d Proc. of 1996 International Workshop on Security Protocols, LNCS 1189, pp. 69\u201387, 1996."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"K. Sako, \u201cAn auction protocol which hides bids of losers,\u201d Proc. of PKC\u20192000, pp. 422\u2013432, 2000.","DOI":"10.1007\/978-3-540-46588-1_28"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"A.C. Yao, \u201cProtocols for Secure Computations,\u201d Proc. of FOCS, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"A.C. Yao, \u201cHow to Generate and Exchange Secrets,\u201d Proc. of FOCS, pp. 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45439-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T02:34:28Z","timestamp":1550457268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45439-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426622","9783540454397"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45439-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}