{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:40:11Z","timestamp":1759092011478},"reference-count":17,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T00:00:00Z","timestamp":1157068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1016\/j.comcom.2005.10.031","type":"journal-article","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T12:14:25Z","timestamp":1134044065000},"page":"2798-2805","source":"Crossref","is-referenced-by-count":17,"title":["Batch verification of validity of bids in homomorphic e-auction"],"prefix":"10.1016","volume":"29","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comcom.2005.10.031_bib1","series-title":"Second conference of Applied Cryptography and Network Security, ACNS 04","first-page":"494","article-title":"Batch verification for equality of discrete logarithms and threshold decryptions","volume":"vol. 3089","author":"Aditya","year":"2004"},{"key":"10.1016\/j.comcom.2005.10.031_bib2","series-title":"EUROCRYPT \u201998","first-page":"236","article-title":"Fast batch verification for modular exponentiation and digital signatures","volume":"vol. 1403","author":"Bellare","year":"1998"},{"key":"10.1016\/j.comcom.2005.10.031_bib3","series-title":"ASIACRYPT \u201900","first-page":"58","article-title":"Attacking and repairing batch verification schemes","volume":"vol. 1976","author":"Boyd","year":"2000"},{"key":"10.1016\/j.comcom.2005.10.031_bib4","series-title":"CRYPTO \u201986","first-page":"251","article-title":"Secret sharing homomorphisms: keeping shares of a secret secret","volume":"vol. 263","author":"Cohen Benaloh","year":"1986"},{"key":"10.1016\/j.comcom.2005.10.031_bib5","series-title":"CRYPTO \u201994","first-page":"174","article-title":"Proofs of partial knowledge and simplified design of witness hiding protocols","volume":"vol. 839","author":"Cramer","year":"1994"},{"key":"10.1016\/j.comcom.2005.10.031_bib6","doi-asserted-by":"crossref","unstructured":"L. Harn. Batch verifying multiple DSA-type digital signatures, in: Electronics Letters, vol. 34, no. 9, 1998, pp. 870\u2013871.","DOI":"10.1049\/el:19980620"},{"key":"10.1016\/j.comcom.2005.10.031_bib7","unstructured":"A. Juels, M. Szydlo. An two-server auction protocol, in: Proc. of Financial Cryptography, 2002, pp. 329\u2013340."},{"key":"10.1016\/j.comcom.2005.10.031_bib8","unstructured":"H. Kikuchi, Michael Harkavy, J.D. Tygar. Multi-round anonymous auction, in: Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, June 1998, pp. 62\u201369."},{"key":"10.1016\/j.comcom.2005.10.031_bib9","series-title":"The Fifth International Conference on Financial Cryptography 2001","first-page":"291","article-title":"(m+1)st-price auction","volume":"vol. 2339","author":"Kikuchi","year":"2001"},{"key":"10.1016\/j.comcom.2005.10.031_bib10","doi-asserted-by":"crossref","unstructured":"Hiroaki Kikuchi, Shinji Hotta, Kensuke Abe, Shohachiro Nakanishi. Distributed auction servers resolving winner and winning bid without revealing privacy of bids, in: Proc. of International Workshop on Next Generation Internet (NGITA2000), IEEE, July 2000, pp. 307\u2013312.","DOI":"10.1109\/PADSW.2000.884610"},{"key":"10.1016\/j.comcom.2005.10.031_bib11","unstructured":"Moni Naor, Benny Pinkas. Efficient oblivious transfer protocols, in: Twelfth Annual Symposium on Discrete Algorithms, January 7\u20139, 2001, Washington, DC, USA. ACM\/SIAM, 2001, pp. 448\u2013457."},{"key":"10.1016\/j.comcom.2005.10.031_bib12","doi-asserted-by":"crossref","unstructured":"Moni Naor, Benny Pinkas, Reuben Sumner. Privacy preserving auctions and mechanism design, in: ACM Conference on Electronic Commerce 1999, 1999, pp. 129\u2013139.","DOI":"10.1145\/336992.337028"},{"key":"10.1016\/j.comcom.2005.10.031_bib13","series-title":"EUROCRYPT \u201991","first-page":"221","article-title":"Distributed provers with applications to undeniable signatures","volume":"vol. 547","author":"Pedersen","year":"1991"},{"key":"10.1016\/j.comcom.2005.10.031_bib14","series-title":"EUROCRYPT \u201991","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume":"vol. 547","author":"Pedersen","year":"1991"},{"key":"10.1016\/j.comcom.2005.10.031_bib15","series-title":"ICICS","first-page":"147","article-title":"Robust, privacy protecting and publicly verifiable sealed-bid auction","volume":"vol. 2513","author":"Peng","year":"2002"},{"key":"10.1016\/j.comcom.2005.10.031_bib16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","author":"Schnorr","year":"1991","journal-title":"J. Cryptol."},{"key":"10.1016\/j.comcom.2005.10.031_bib17","doi-asserted-by":"crossref","unstructured":"Wen-Guey Tzeng. Efficient 1-out-n oblivious transfer schemes, in: Public Key Cryptography, 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002, Paris, France, February 12\u201314, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2274, Springer, 2002, pp. 159\u2013171.","DOI":"10.1007\/3-540-45664-3_11"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366405004214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366405004214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T12:08:08Z","timestamp":1586606888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366405004214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":17,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["S0140366405004214"],"URL":"https:\/\/doi.org\/10.1016\/j.comcom.2005.10.031","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}