{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:05:11Z","timestamp":1649207111509},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,10,9]],"date-time":"2010-10-09T00:00:00Z","timestamp":1286582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron Commer Res"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10660-010-9057-x","type":"journal-article","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T18:36:02Z","timestamp":1286994962000},"page":"291-311","source":"Crossref","is-referenced-by-count":1,"title":["On server trust in private proxy auctions"],"prefix":"10.1007","volume":"10","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Herranz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"S\u00e1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,9]]},"reference":[{"key":"9057_CR1","unstructured":"Http:\/\/www.ebay.com\/."},{"key":"9057_CR2","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-45664-3_8","volume-title":"Proc. of public key cryptography\u201902","author":"M. Abe","year":"2002","unstructured":"Abe, M., & Suzuki, K. (2002). M+1-st price auction using homomorphic encryption. In LNCS : Vol. 2274. Proc. of public key cryptography\u201902 (pp. 115\u2013224). Berlin: Springer."},{"key":"9057_CR3","series-title":"LNCS","first-page":"142","volume-title":"Proc. of financial cryptography\u201906","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damgard, I., Jakobsen, T., Nielsen, K., Pagter, J., & Toft, T. (2006). A practical implementation of secure auctions based on multiparty integer computation. In LNCS : Vol. 4107. Proc. of financial cryptography\u201906 (pp. 142\u2013147). Berlin: Springer."},{"key":"9057_CR4","series-title":"LNCS","first-page":"431","volume-title":"Proc. of Eurocrypt\u201900","author":"F. Boudot","year":"2000","unstructured":"Boudot, F. (2000). Efficient proofs that a committed number lies in an interval. In LNCS : Vol. 1807. Proc. of Eurocrypt\u201900 (pp. 431\u2013444). Berlin: Springer."},{"issue":"6","key":"9057_CR5","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., & Persiano, G. (1991). Non-interactive zero-knowledge. SIAM Journal of Computing, 20(6), 1084\u20131118.","journal-title":"SIAM Journal of Computing"},{"key":"9057_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, C. (1999). Efficient private bidding and auctions with an oblivious third party. In: Proc. of ACM conference CCS\u201999 (pp. 120\u2013127).","DOI":"10.1145\/319709.319726"},{"key":"9057_CR7","series-title":"LNCS","first-page":"234","volume-title":"Proc. of Asiacrypt\u201908","author":"J. Camenisch","year":"2008","unstructured":"Camenisch, J., Chaabouni, R., & Shelat, A. (2008). Efficient protocols for set membership and range proofs. In LNCS : Vol. 5350. Proc. of Asiacrypt\u201908 (pp. 234\u2013252). Berlin: Springer."},{"key":"9057_CR8","series-title":"LNCS","first-page":"174","volume-title":"Proc. of Crypto\u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., & Schoenmakers, B. (1994). Proofs of partial knowledge and simplified design of witness hiding protocols. In LNCS : Vol. 839. Proc. of Crypto\u201994 (pp. 174\u2013187). Berlin: Springer."},{"key":"9057_CR9","unstructured":"Canetti, R., Goldreich, O., & Halevi, S. (1998). The random oracle methodology, revisited. In: Proc. of ACM symposium on theory of computing\u201998 (pp. 209\u2013218)."},{"key":"9057_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(94)90237-2","volume":"132","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Di Crescenzo, G., & Persiano, G. (1994). The knowledge complexity of quadratic residuosity languages. Theoretical Computer Science, 132, 291\u2013317.","journal-title":"Theoretical Computer Science"},{"key":"9057_CR11","series-title":"LNCS","first-page":"356","volume-title":"Proc. of mathematical foundations of computer science\u201904","author":"A. Santis De","year":"2004","unstructured":"De Santis, A., Di Crescenzo, G., & Persiano, G. (2004). On NC1 Boolean circuit composition of non-interactive perfect zero-knowledge. In LNCS : Vol. 3153. Proc. of mathematical foundations of computer science\u201904 (pp. 356\u2013367). Berlin: Springer."},{"issue":"4","key":"9057_CR12","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1137\/S0097539798346123","volume":"38","author":"A. Santis De","year":"2008","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., & Yung, M. (2008). On monotone formula composition of perfect zero-knowledge languages. SIAM Journal on Computing, 38(4), 1300\u20131329.","journal-title":"SIAM Journal on Computing"},{"key":"9057_CR13","series-title":"LNCS","first-page":"10","volume-title":"Proc. of CISC\u201905","author":"G. Crescenzo Di","year":"2005","unstructured":"Di Crescenzo, G. (2005). You can prove so many things in zero-knowledge. In LNCS : Vol. 3822. Proc. of CISC\u201905 (pp. 10\u201327). Berlin: Springer."},{"key":"9057_CR14","series-title":"LNCS","first-page":"72","volume-title":"Proc. of Financial Cryptography\u201900","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G. (2000). Private selective payment protocols. In LNCS : Vol. 1962. Proc. of Financial Cryptography\u201900 (pp. 72\u201389). Berlin: Springer."},{"key":"9057_CR15","series-title":"LNCS","first-page":"367","volume-title":"Proc. of Eurocrypt\u201995","author":"G. Crescenzo Di","year":"1995","unstructured":"Di Crescenzo, G. (1995). Recycling random bits in composed perfect zero-knowledge. In LNCS : Vol. 921. Proc. of Eurocrypt\u201995 (pp. 367\u2013381). Berlin: Springer."},{"key":"9057_CR16","series-title":"LNCS","first-page":"80","volume-title":"Proc. of TrusBus\u201904","author":"G. Crescenzo Di","year":"2004","unstructured":"Di Crescenzo, G., Herranz, J., & S\u00e1ez, G. (2004). Reducing server trust in private proxy auctions. In LNCS : Vol. 3184. Proc. of TrusBus\u201904 (pp. 80\u201389). Berlin: Springer."},{"key":"9057_CR17","series-title":"LNCS","first-page":"186","volume-title":"Proc. of Crypto\u201986","author":"A. Fiat","year":"1986","unstructured":"Fiat, A., & Shamir, A. (1986). How to prove yourself: practical solutions to identification and signature problems. In LNCS : Vol. 263. Proc. of Crypto\u201986 (pp. 186\u2013194). Berlin: Springer."},{"issue":"1","key":"9057_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., & Shamir, A. (1999). Multiple non-interactive zero knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1), 1\u201328.","journal-title":"SIAM Journal on Computing"},{"key":"9057_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: basic applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O. (2004). Foundations of cryptography: basic applications. Cambridge: Cambridge University Press."},{"issue":"2","key":"9057_CR20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., & Micali, S. (1984). Probabilistic Encryption. Journal of Computer and System Sciences, 28(2), 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9057_CR21","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., & Rackoff, C. (1989). The knowledge complexity of interactive proof-systems. SIAM Journal on Computing, 18(1), 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"9057_CR22","unstructured":"Harkavy, M., Tygar, D., & Kikuchi, H. (1998). Electronic auctions with private bids. In: Proc. of 3rd USENIX workshop on electronic commerce (pp. 61\u201374)."},{"key":"9057_CR23","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-36504-4_6","volume-title":"Proc. of financial cryptography\u201903","author":"A. Juels","year":"2003","unstructured":"Juels, A., & Szydlo, M. (2003). A Two-server, sealed-bid auction protocol. In LNCS : Vol. 2357. Proc. of financial cryptography\u201903 (pp. 72\u201386). Berlin: Springer."},{"key":"9057_CR24","series-title":"LNCS","first-page":"351","volume-title":"Proc. of financial cryptography\u201901","author":"H. Kikuchi","year":"2001","unstructured":"Kikuchi, H. (2001). (M+1)st-price auction protocol. In LNCS : Vol. 2339. Proc. of financial cryptography\u201901 (pp. 351\u2013363). Berlin: Springer."},{"key":"9057_CR25","series-title":"LNCS","first-page":"398","volume-title":"Proc. of Asiacrypt\u201903","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H. (2003). On diophantine complexity and statistical zero-knowledge arguments. In LNCS : Vol. 2894. Proc. of Asiacrypt\u201903 (pp. 398\u2013415). Berlin: Springer."},{"key":"9057_CR26","series-title":"LNCS","first-page":"87","volume-title":"Proc. of financial cryptography\u201902","author":"H. Lipmaa","year":"2002","unstructured":"Lipmaa, H., Asokan, N., & Niemi, V. (2002). Secure Vickrey auctions without threshold trust. In LNCS : Vol. 2357. Proc. of financial cryptography\u201902 (pp. 87\u2013101). Berlin: Springer."},{"key":"9057_CR27","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Proc. of public-key cryptography\u201998","author":"W. Mao","year":"1998","unstructured":"Mao, W. (1998). Guaranteed correct sharing of integer factorization with off-line share- holders. In LNCS : Vol. 1431. Proc. of public-key cryptography\u201998 (pp. 60\u201371). Berlin: Springer."},{"key":"9057_CR28","unstructured":"Naor, M., Pinkas, B., & Sumner, R. (1999). Privacy preserving auctions and mechanism design. In: Proc. of the ACM Conference on Electronic Commerce (pp. 129\u2013139)."},{"key":"9057_CR29","series-title":"LNCS","first-page":"522","volume-title":"Proc. of Eurocrypt\u201991","author":"T. P. Pedersen","year":"1991","unstructured":"Pedersen, T. P. (1991). A threshold cryptosystem without a trusted party. In LNCS : Vol. 547. Proc. of Eurocrypt\u201991 (pp. 522\u2013526). Berlin: Springer."},{"key":"9057_CR30","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Proc. of public key cryptography\u201900","author":"K. Sako","year":"2000","unstructured":"Sako, K. (2000). An auction protocol which hides bids of losers. In LNCS : Vol. 1751. Proc. of public key cryptography\u201900 (pp. 422\u2013432). Berlin: Springer."},{"key":"9057_CR31","series-title":"LNCS","first-page":"239","volume-title":"Proc. of Crypto\u201989","author":"C. P. Schnorr","year":"1990","unstructured":"Schnorr, C. P. (1990). Efficient identification and signatures for smart cards. In LNCS : Vol. 435. Proc. of Crypto\u201989 (pp. 239\u2013252). Berlin: Springer."},{"key":"9057_CR32","unstructured":"Sakurai, K., & Miyazaki, S. (1999). A bulletin-board based digital auction scheme with bidding down strategy. In: Proc. of CrypTEC\u201999 (pp. 180\u2013187)."},{"key":"9057_CR33","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-48390-X_17","volume-title":"Proc. of financial cryptography\u201999","author":"S. Stubblebine","year":"1999","unstructured":"Stubblebine, S., & Syverson, P. (1999). Fair on-line auctions without special trusted parties. In LNCS : Vol. 1648. Proc. of financial cryptography\u201999 (pp. 230\u2013240). Berlin: Springer."},{"key":"9057_CR34","series-title":"LNCS","first-page":"525","volume-title":"Proc. of public key cryptography\u201906","author":"I. Teranishi","year":"2006","unstructured":"Teranishi, I., & Sako, K. (2006). K-times anonymous authentication with a constant proving cost. In LNCS : Vol. 3958. Proc. of public key cryptography\u201906 (pp. 525\u2013542). Berlin: Springer."},{"issue":"1","key":"9057_CR35","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1), 8\u201337.","journal-title":"Journal of Finance"},{"key":"9057_CR36","series-title":"LNCS","first-page":"138","volume-title":"Proc. of Cocoon\u201909","author":"T. H. Yuen","year":"2009","unstructured":"Yuen, T. H., Huang, Q., Mu, Y., Susilo, W., Wong, D. S., & Yang, G. (2009). Efficient non-interactive range proof. In LNCS : Vol. 5609. Proc. of Cocoon\u201909 (pp. 138\u2013147). Berlin: Springer."}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-010-9057-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10660-010-9057-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-010-9057-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:52:52Z","timestamp":1559249572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10660-010-9057-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,9]]},"references-count":36,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9057"],"URL":"https:\/\/doi.org\/10.1007\/s10660-010-9057-x","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,9]]}}}