{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:10:43Z","timestamp":1725624643185},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642251405"},{"type":"electronic","value":"9783642251412"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25141-2_4","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T13:30:01Z","timestamp":1319290201000},"page":"51-64","source":"Crossref","is-referenced-by-count":6,"title":["A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits"],"prefix":"10.1007","author":[{"given":"Takuho","family":"Mistunaga","sequence":"first","affiliation":[]},{"given":"Yoshifumi","family":"Manabe","sequence":"additional","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45664-3_8","volume-title":"Public Key Cryptography","author":"M. Abe","year":"2002","unstructured":"Abe, M., Suzuki, K.: M\u2009+\u20091st price auction using homomorphic encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 115\u2013124. Springer, Heidelberg (2002)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.K.: Efficient Generation of Shared RSA keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 84\u201388 (1981)","DOI":"10.1145\/358549.358563"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"M.K. Franklin","year":"1995","unstructured":"Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction service. IEEE Transactions on Software Engineering\u00a022(5), 302\u2013312 (1995)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-36504-4_6","volume-title":"Financial Cryptography","author":"A. Juels","year":"2003","unstructured":"Juels, A., Szydlo, M.: A Two-Server Sealed-Bid Auction Protocol. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 72\u201386. Springer, Heidelberg (2003)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45853-0_2","volume-title":"Computer Security - ESORICS 2002","author":"K. Kurosawa","year":"2002","unstructured":"Kurosawa, K., Ogata, W.: Bit-Slice Auction Circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 24\u201338. Springer, Heidelberg (2002)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","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, pp. 87\u2013101. Springer, Heidelberg (2003)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/336992.337028","volume-title":"Proceedings of the 1st ACM Conference on Electronic Commerce (ACM-EC)","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce (ACM-EC), pp. 129\u2013139. ACM press, New York (1999)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-16825-3_11","volume-title":"Advances in Information and Computer Security","author":"T. Mitsunaga","year":"2010","unstructured":"Mitsunaga, T., Manabe, Y., Okamoto, T.: Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds.) IWSEC 2010. LNCS, vol.\u00a06434, pp. 149\u2013163. Springer, Heidelberg (2010)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C.-s. Park","year":"1994","unstructured":"Park, C.-s., 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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25141-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T06:15:06Z","timestamp":1538720106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25141-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642251405","9783642251412"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25141-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}