{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:40:33Z","timestamp":1761975633729,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385520"},{"type":"electronic","value":"9783642385537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38553-7_5","type":"book-chapter","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:47:12Z","timestamp":1368060432000},"page":"88-106","source":"Crossref","is-referenced-by-count":2,"title":["Brandt\u2019s Fully Private Auction Protocol Revisited"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Dreier","sequence":"first","affiliation":[]},{"given":"Jean-Guillaume","family":"Dumas","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-30580-4_11","volume-title":"Public Key Cryptography - PKC 2005","author":"E. Bangerter","year":"2005","unstructured":"Bangerter, E., Camenisch, J.L., Maurer, U.M.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 154\u2013171. Springer, Heidelberg (2005)"},{"key":"5_CR2","unstructured":"Brandt, F.: A verifiable, bidder-resolved auction protocol. In: Falcone, R., Barber, S., Korba, L., Singh, M. (eds.) Proceedings of the 5th AAMAS Workshop on Deception, Fraud and Trust in Agent Societies, pp. 18\u201325 (2002)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-45126-6_16","volume-title":"Financial Cryptography","author":"F. Brandt","year":"2003","unstructured":"Brandt, F.: Fully private auctions in a constant number of rounds. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 223\u2013238. Springer, Heidelberg (2003)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10207-006-0001-y","volume":"5","author":"F. Brandt","year":"2006","unstructured":"Brandt, F.: How to obtain full privacy in auctions. International Journal of Information Security\u00a05, 201\u2013216 (2006)","journal-title":"International Journal of Information Security"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-46885-4_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"M. Burmester","year":"1990","unstructured":"Burmester, M., Desmedt, Y.G., Piper, F., Walker, M.: A general zero-knowledge scheme. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 122\u2013133. Springer, Heidelberg (1990)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47721-7_14","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"D. Chaum","year":"1987","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J., Peralta, R.: Demonstrating possession of a discrete logarithm without revealing it. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 200\u2013212. Springer, Heidelberg (1987)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J.: An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 127\u2013141. Springer, Heidelberg (1988)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-14031-0_55","volume-title":"Computing and Combinatorics","author":"S.S.M. Chow","year":"2010","unstructured":"Chow, S.S.M., Ma, C., Weng, J.: Zero-Knowledge Argument for Simultaneous Discrete Logarithms. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 520\u2013529. Springer, Heidelberg (2010)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.B.: Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge Be for Free? In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 424\u2013441. Springer, Heidelberg (1998)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Curtis, B., Pieprzyk, J., Seruga, J.: An efficient eAuction protocol. In: ARES, pp. 417\u2013421. IEEE Computer Society (2007)","DOI":"10.1109\/ARES.2007.37"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s00145-009-9045-2","volume":"22","author":"M. Fischlin","year":"2009","unstructured":"Fischlin, M., Fischlin, R.: Efficient non-malleable commitment schemes. Journal of Cryptology\u00a022, 530\u2013571 (2009)","journal-title":"Journal of Cryptology"},{"key":"5_CR16","unstructured":"Katz, J.: Efficient cryptographic protocols preventing \u201cman-in-the-middle\u201d attacks. PhD thesis, Columbia University (2002)"},{"key":"5_CR17","volume-title":"Auction Theory","author":"V. Krishna","year":"2002","unstructured":"Krishna, V.: Auction Theory. Academic Press, San Diego (2002)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-02384-2_17","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"U. Maurer","year":"2009","unstructured":"Maurer, U.: Unifying zero-knowledge proofs of knowledge. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 272\u2013286. Springer, Heidelberg (2009)"},{"key":"5_CR19","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":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-47719-5_19","volume-title":"Information Security and Privacy","author":"K. Omote","year":"2001","unstructured":"Omote, K., Miyaji, A.: A Practical English Auction with One-Time Registration. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 221\u2013234. Springer, Heidelberg (2001)"},{"key":"5_CR21","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":"5_CR22","doi-asserted-by":"crossref","unstructured":"Sadeghi, A.R., Schunter, M., Steinbrecher, S.: Private auctions with multiple rounds and multiple items. In: DEXA Workshops, pp. 423\u2013427. IEEE (2002)","DOI":"10.1109\/DEXA.2002.1045932"},{"key":"5_CR23","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)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38553-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:17:49Z","timestamp":1746004669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38553-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385520","9783642385537"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38553-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}