{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:10:17Z","timestamp":1737321017339,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006466"},{"type":"electronic","value":"9783540365044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36504-4_6","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T18:48:45Z","timestamp":1184957325000},"page":"72-86","source":"Crossref","is-referenced-by-count":54,"title":["A Two-Server, Sealed-Bid Auction Protocol"],"prefix":"10.1007","author":[{"given":"Ari","family":"Juels","sequence":"first","affiliation":[]},{"given":"Michael","family":"Szydlo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"O. Baudron and J. Stern. Non-interactive private auctions. In S. Haber, editor, Financial Cryptography\u2019 01, pages 303\u2013313, 2001."},{"key":"6_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Advances in Cryptology-Eurocrypt\u2019 00","author":"D. Beaver","year":"2000","unstructured":"D. Beaver. Minimal-latency secure function evaluation. In B. Preneel, editor, Advances in Cryptology-Eurocrypt\u2019 00, pages 335\u2013350. Springer-Verlag, 2000. LNCS no. 1807."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali, and P. Rogaway. The round complexity of secure protocols. In ACM CCS\u2019 90, pages 503\u2013513. ACM Press, 1990.","DOI":"10.1145\/100216.100287"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology-Crypto\u2019 84","author":"M. Blum","year":"1985","unstructured":"M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In G.R Blakely and D. Chaum, editors, Advances in Cryptology-Crypto\u2019 84, pages 289\u2013299. Springer-Verlag, 1985. LNCS No. 196."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"C. Cachin. Efficient private bidding and auctions with an oblivious third party. In G. Tsudik, editor, ACM CCS\u2019 99, pages 120\u2013127. ACM Press, 1999.","DOI":"10.1145\/319709.319726"},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology-Crypto\u2019 00","author":"C. Cachin","year":"2000","unstructured":"C. Cachin and J. Camenisch. Optimistic fair secure computation. In M. Bellare, editor, Advances in Cryptology-Crypto\u2019 00, pages 94\u2013112. Springer-Verlag, 2000. LNCS no. 1880."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents, 2000.","DOI":"10.1007\/3-540-45022-X_43"},{"key":"6_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology-Eurocrypt\u2019 01","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, and J.B. Nielsen. Multiparty computation from threshold homomorphic encryption. In B. Pfitzmann, editor, Advances in Cryptology-Eurocrypt\u2019 01, pages 280\u2013300. Springer-Verlag, 2001. LNCS no. 2045."},{"key":"6_CR9","series-title":"Lect Notes Comput Sci","first-page":"181","volume-title":"Advances in Cryptology-Eurocrypt\u2019 89","author":"C. Crep\u00e9au","year":"1990","unstructured":"Claude Crep\u00e9au. Verifiable disclosure of secrets and applications. In J.J. Quisquater and J. Vandewalle, editors, Advances in Cryptology-Eurocrypt\u2019 89, pages 181\u2013191. Springer-Verlag, 1990. LNCS no. 434."},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology-Crypto\u2019 95","author":"C. Crep\u00e9au","year":"1995","unstructured":"Claude Crep\u00e9au, van de Graaf, Jeroen, and Alain Tapp. Committed oblivious transfer and private multi-party computation. In D. Coppersmith, editor, Advances in Cryptology-Crypto\u2019 95, pages 110\u2013123. Springer-Verlag, 1995. LNCS No. 963."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo. Private selective payment protocols. In P. Syverson, editor, Financial Cryptography\u2019 00, 2000.","DOI":"10.1007\/3-540-45472-1_6"},{"issue":"5","key":"6_CR12","first-page":"302","volume":"22","author":"M. Franklin","year":"1996","unstructured":"M. Franklin and M. Reiter. The design and implementation of a secure auction server. IEEE Transactions on Information Theory, 22(5):302\u2013312, 1996.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung. Varieties of secure distributed computing. In Proc. Sequences II, Methods in Communications, Security and Computer Science, pages 392\u2013417, 1991.","DOI":"10.1007\/978-1-4613-9323-8_30"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC\u2019 87, pages 218\u2013229. ACM Press, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. J. Comp. Sys. Sci, 28(1):270\u2013299, 1984.","journal-title":"J. Comp. Sys. Sci"},{"key":"6_CR17","unstructured":"M. Harkavy, J.D. Tygar, and H. Kikuchi. Electronic auctions with private bids. In 3rd USENIX Workshop on Electronic Commerce, pages 61\u201373, 1999."},{"key":"6_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology-Asiacrypt\u2019 00","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, editor, Advances in Cryptology-Asiacrypt\u2019 00, pages 143\u2013161. Springer-Verlag, 2000. LNCS No. 1976."},{"key":"6_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology-Asiacrypt\u2019 00","author":"M. Jakobsson","year":"2000","unstructured":"M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology-Asiacrypt\u2019 00, pages 162\u2013177. Springer-Verlag, 2000. LNCS No. 1976."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In 1st ACM Conf. on Electronic Commerce, pages 129\u2013139. ACM Press, 1999.","DOI":"10.1145\/336992.337028"},{"key":"6_CR21","unstructured":"M. Rabin. How to exchange secrets by oblivious transfer, 1991. Tech. Memo TR-81 Aiken Computation Laboratory, Harvard University."},{"key":"6_CR22","unstructured":"R. L. Rivest. Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, 1999."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1977","unstructured":"R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120\u2013126, 1977.","journal-title":"Communications of the ACM"},{"key":"6_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"PKC\u2019 00","author":"K. Sako","year":"2000","unstructured":"K. Sako. An auction protocol which hides bids of losers. In H. Imai and Y. Zheng, editors, PKC\u2019 00, pages 422\u2013432. Springer-Verlag, 2000. LNCS no. 1751."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Stuart G. Stubblebine and Paul F. Syverson. Fair on-line auctions without special trusted parties. In Financial Cryptography, pages 230\u2013240, 1999.","DOI":"10.1007\/3-540-48390-X_17"},{"key":"6_CR26","unstructured":"A.C. Yao. Protocols for secure computations (extended abstract). In FOCS\u2019 82, pages 160\u2013164. IEEE Computer Society, 1982."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36504-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:47:58Z","timestamp":1737319678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36504-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006466","9783540365044"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36504-4_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}