{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:52:50Z","timestamp":1755838370407,"version":"3.40.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319063195"},{"type":"electronic","value":"9783319063201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06320-1_23","type":"book-chapter","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T00:59:27Z","timestamp":1398646767000},"page":"302-317","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Mehrdad","family":"Nojoumian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_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+1-st price auction using homomorphic encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 115\u2013124. Springer, Heidelberg (2002)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","first-page":"354","volume-title":"Financial Cryptography","author":"O. Baudron","year":"2002","unstructured":"Baudron, O., Stern, J.: Non-interactive private auctions. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 354\u2013377. Springer, Heidelberg (2002)"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T. Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega\u00a034(3), 209\u2013219 (2006)","journal-title":"Omega"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing, STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: National Computer Conference, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"23_CR6","unstructured":"Brandt, F.: A verifiable, bidder-resolved auction protocol. In: 5th Int. Workshop on Deception, Fraud and Trust in Agent Societies, Special Track on Privacy and Protection with Multi-Agent Systems, pp. 18\u201325 (2002)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: ACM Conference on Computer and Communications Security, pp. 120\u2013127 (1999)","DOI":"10.1145\/319709.319726"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"issue":"5","key":"23_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","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 Eng.\u00a022(5), 302\u2013312 (1996)","journal-title":"IEEE Transactions on Software Eng."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-71677-8_22","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J.A. Garay","year":"2007","unstructured":"Garay, J.A., Schoenmakers, B., Villegas, J.: Practical and secure solutions for integer comparison. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 330\u2013342. Springer, Heidelberg (2007)"},{"key":"23_CR12","unstructured":"Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic auctions with private bids. In: 3rd Workshop on E-Commerce, pp. 61\u201374. USENIX Association (1998)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kikuchi, H.: (M+1)st-price auction protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 341\u2013363. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-46088-8_27"},{"key":"23_CR14","first-page":"769","volume":"82","author":"H. Kikuchi","year":"1999","unstructured":"Kikuchi, H., Harkavy, M., Tygar, J.D.: Multi-round anonymous auction protocols. IEICE Transaction on Information and Systems\u00a082, 769\u2013777 (1999)","journal-title":"IEICE Transaction on Information and Systems"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In: 7th Int. Conference on Parallel and Distributed Systems, pp. 307\u2013312. IEEE (2000)","DOI":"10.1109\/PADSW.2000.884610"},{"key":"23_CR16","unstructured":"Kim, I.C.: Task reallocation in multiagent systems based on vickrey auctioning. In: International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, pp. 40\u201344. IOS Press (2002)"},{"key":"23_CR17","unstructured":"Krishnamachari, S., Nojoumian, M., Akkaya, K.: Implementation and analysis of dutch-style sealed-bid auctions: Computational vs unconditional security (2014) (Under Review Manuscript)"},{"key":"23_CR18","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":"23_CR19","unstructured":"MacWilliams, F., Sloane, N.: The theory of error-correcting codes. North-Holland Amsterdam (1978)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: ACM Conference on Electronic Commerce, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/10718964_35","volume-title":"Information Security and Privacy","author":"K.Q. Nguyen","year":"2000","unstructured":"Nguyen, K.Q., Traor\u00e9, J.: An online public auction protocol protecting bidder privacy. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol.\u00a01841, pp. 427\u2013442. Springer, Heidelberg (2000)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-17650-0_19","volume-title":"Information and Communications Security","author":"M. Nojoumian","year":"2010","unstructured":"Nojoumian, M., Stinson, D.R.: Unconditionally secure first-price auction protocols using a multicomponent commitment scheme. In: Soriano, M., Qing, S., L\u00f3pez, J. (eds.) ICICS 2010. LNCS, vol.\u00a06476, pp. 266\u2013280. Springer, Heidelberg (2010)"},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3934\/amc.2013.7.39","volume":"7","author":"M. Nojoumian","year":"2013","unstructured":"Nojoumian, M., Stinson, D.R.: On dealer-free dynamic threshold schemes. Advances in Mathematics of Communications, AMC\u00a07(1), 39\u201356 (2013)","journal-title":"Advances in Mathematics of Communications, AMC"},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.elerap.2008.04.006","volume":"7","author":"D.C. Parkes","year":"2008","unstructured":"Parkes, D.C., Rabin, M.O., Shieber, S.M., Thorpe, C.: Practical secrecy-preserving, verifiably correct and trustworthy auctions. Electronic Commerce Research and Applications\u00a07(3), 294\u2013312 (2008)","journal-title":"Electronic Commerce Research and Applications"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11554868_7","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"K. Peng","year":"2005","unstructured":"Peng, K., Boyd, C., Dawson, E.: Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 84\u201398. Springer, Heidelberg (2005)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-36159-6_13","volume-title":"Information and Communications Security","author":"K. Peng","year":"2002","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, privacy protecting and publicly verifiable sealed-bid auction. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol.\u00a02513, pp. 147\u2013159. Springer, Heidelberg (2002)"},{"key":"23_CR28","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Five sealed-bid auction models. In: Australasian Information Security Workshop Conference, pp. 77\u201386. Australian Computer Society (2003)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21th Annual ACM Symposium on Theory of Computing, STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"23_CR30","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 protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 422\u2013432. Springer, Heidelberg (2000)"},{"issue":"11","key":"23_CR31","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46513-8_15","volume-title":"Selected Areas in Cryptography","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R.: Unconditionally secure proactive secret sharing scheme with combinatorial structures. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 200\u2013214. Springer, Heidelberg (2000)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-36504-4_4","volume-title":"Financial Cryptography","author":"K. Suzuki","year":"2003","unstructured":"Suzuki, K., Yokoo, M.: Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 44\u201356. Springer, Heidelberg (2003)"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11604938_24","volume-title":"Information Security Applications","author":"K. Suzuki","year":"2006","unstructured":"Suzuki, K., Yokoo, M.: Secure multi-attribute procurement auction. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol.\u00a03786, pp. 306\u2013317. Springer, Heidelberg (2006)"},{"issue":"1","key":"23_CR35","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance\u00a016(1), 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"23_CR36","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":"23_CR37","doi-asserted-by":"crossref","unstructured":"Watanabe, Y., Imai, H.: Reducing the round complexity of a sealed-bid auction protocol with an off-line ttp. In: ACM Conference on Computer and Communications Security, CCS, pp. 80\u201386 (2000)","DOI":"10.1145\/352600.352612"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: 23rd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Suzuki, K.: Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions. In: 1st International Joint Conference on AAMAS, pp. 112\u2013119. ACM (2002)","DOI":"10.1145\/544741.544770"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06320-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T15:35:18Z","timestamp":1746200118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06320-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319063195","9783319063201"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06320-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}