{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:33:08Z","timestamp":1762003988874,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443452"},{"type":"electronic","value":"9783540458531"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45853-0_2","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:42:13Z","timestamp":1178224933000},"page":"24-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Bit-Slice Auction Circuit"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Wakaha","family":"Ogata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,26]]},"reference":[{"key":"2_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Proc. of Asiacrypt\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe, \u201cMix-Networks on permutation networks,\u201d Proc. of Asiacrypt\u2019 99, LNCS Vol. 1716, pp. 258\u2013273 (1999)."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M. Abe and F. Hoshino, \u201cRemarks on Mix-Network Based on Permutation Networks, \u201d Proc. of PKC 2001, pp. 317\u2013324 (2001).","DOI":"10.1007\/3-540-44586-2_23"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"M. Abe and K. Suzuki, \u201cM1-st Price Auction Using Homomorphic Encryption,\u201d Proc. of PKC2002, pp. 115\u2013124 (2002).","DOI":"10.1007\/3-540-45664-3_8"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"O. Baudron and J. Stern, \u201cNon-Interactive Private Auctions,\u201d Proc. of Financial Cryptography 2001 (2001).","DOI":"10.1007\/3-540-46088-8_28"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. \u201cCompleteness theorems for non-cryptographic fault-tolerant distributed computation,\u201d Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 1\u201310, May 2\u20134 (1988).","DOI":"10.1145\/62212.62213"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"C. Cachin, \u201cEfficient private bidding and auctions with an oblivious third party,\u201d ACM CSS\u2019 99, pp. 120\u2013127, ACM (1999).","DOI":"10.1145\/319709.319726"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, \u201cSecurity and composition of multiparty cryptographic protocols,\u201d Journal of Cryptology, Vol. 13, No. 1, pp. 143\u2013202 (2000).","journal-title":"Journal of Cryptology"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum, \u201cUntraceable electronic mail, return addresses, and digital pseudonyms,\u201d Communications of the ACM, Vol. 24, pp. 84\u201388 (1981).","journal-title":"Communications of the ACM"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. \u201cMultiparty unconditionally secure protocols,\u201d Proc. of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 11\u201319, May 2\u20134 (1988).","DOI":"10.1145\/62212.62214"},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Proc. of Eurocrypt\u201901","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, and J. B. Nielsen, \u201cMultiparty Computation from Threshold Homomorphic Encryption,\u201d Proc. of Eurocrypt\u201901, LNCS Vol. 2045, pp. 280\u2013300 (2001)."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Proc. of CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers, \u201cProofs of partial knowledge and simplified design of witness hiding protocols,\u201d Proc. of CRYPTO\u2019 94. LNCS Vol. 839, pp. 174\u2013187 (1994)."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel, \u201cThreshold cryptosystems,\u201d In Proc. of Crypto\u2019 89, pp. 307\u2013315.","DOI":"10.1007\/0-387-34805-0_28"},{"key":"2_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45472-1_6","volume-title":"Proc. of Financial Cryptography","author":"G. Crescenzo Di","year":"2000","unstructured":"G. Di Crescenzo, \u201cPrivate selective payment protocols,\u201d In Proc. of Financial Cryptography\u2019 00, LNCS Vol. 1962, pp. 72\u201389 (2000)."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Reiter, \u201cThe Design and Implementation of a Secure Auction Service,\u201d IEEE Trans. on Software Engineering, Vol. 22, No. 5 (1996).","DOI":"10.1109\/32.502223"},{"key":"2_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Proc of Eurocrypt\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, \u201cRobust threshold DSS signatures,\u201d In Proc of Eurocrypt\u2019 96, LNCS Vol. 1070, pp. 354\u2013371 (1996)."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. \u201cHow to play any mental game,\u201d In Proceedings of the nineteenth annual ACM Symp. Theory of Computing, STOC, pp. 218\u2013229, May 25\u201327 (1987).","DOI":"10.1145\/28395.28420"},{"key":"2_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Proc. of Asiacrypt\u20192000","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, and B. Przydatek, \u201cEfficient secure multiparty computation, \u201d Proc. of Asiacrypt\u20192000, LNCS Vol. 1976, pp. 143\u2013161 (2000)."},{"key":"2_CR18","unstructured":"M. Harkavy, J. D. Tygar, and H. Kikuchi, \u201cElectronic auction with private bids,\u201d In Third USENIX Workshop on Electronic Commerce Proceedings, pp. 61\u201374 (1998)."},{"key":"2_CR19","unstructured":"M. Jakobsson and A. Juels, \u201cMillimix: Mixing in small batches,\u201d DIMACS Technical report 99-33 (June 1999)."},{"key":"2_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Proc. of Asiacrypt 2000","author":"M. Jakobsson","year":"2000","unstructured":"M. Jakobsson and A. Juels, \u201cMix and Match: Secure Function Evaluation via Ciphertexts,\u201d In Proc. of Asiacrypt 2000, LNCS Vol. 1976, pp. 162\u2013177 (2000)."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"A. Juels and M. Szydlo, \u201cAn Two-Server Auction Protocol,\u201d In Proc. of Financial Cryptography 2002, (2002).","DOI":"10.1007\/3-540-36504-4_6"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas, and R. Sumner, \u201cPrivacy preserving auctions and mechanism design,\u201d In 1st ACM Conference on Electronic Commerce, pp. 129\u2013140, ACM (1999).","DOI":"10.1145\/336992.337028"},{"key":"2_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Proc. of PKC\u20192000","author":"K. Sako","year":"2000","unstructured":"K. Sako, \u201cAn auction protocol which hides bids of losers,\u201d Proc. of PKC\u20192000, LNCS Vol. 1751, pp. 422\u2013432 (2000)."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, \u201cHow to Share a Secret,\u201d Communications of the ACM, Vol. 22, pp. 612\u2013613 (1979).","journal-title":"Communications of the ACM"},{"key":"2_CR25","unstructured":"A. Yao, \u201cProtocols for secure computations (extended abstract),\u201d Proc. of FOCS\u201982, pp. 160\u2013164, IEEE Computer Society (1982)."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2014 ESORICS 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45853-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:09:06Z","timestamp":1559506146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45853-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443452","9783540458531"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45853-0_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"26 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}