{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:38:00Z","timestamp":1759091880612,"version":"3.41.0"},"reference-count":26,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCS"],"published-print":{"date-parts":[[2015,9,29]]},"DOI":"10.3233\/jcs-150535","type":"journal-article","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T16:36:44Z","timestamp":1448037404000},"page":"587-610","source":"Crossref","is-referenced-by-count":9,"title":["Brandt\u2019s fully private auction protocol revisited"],"prefix":"10.1177","volume":"23","author":[{"given":"Jannik","family":"Dreier","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lorraine, Loria, UMR 7503, Vandoeuvre-l\u00e8s-Nancy, France"},{"name":"Inria, Villers-l\u00e8s-Nancy, France"},{"name":"CNRS, Loria, UMR 7503, Vandoeuvre-l\u00e8s-Nancy, France. E-mail:\u00a0jannik.dreier@loria.fr"}]},{"given":"Jean-Guillaume","family":"Dumas","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CNRS, Laboratoire Jean Kuntzmann, Grenoble Cedex 9, France. E-mail:\u00a0jean-guillaume.dumas@imag.fr"}]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[{"name":"University Clermont Auvergne, LIMOS, Aubi\u00e8re Cedex, France. E-mail:\u00a0pascal.lafourcade@udamail.fr"}]}],"member":"179","reference":[{"key":"10.3233\/JCS-150535_ref1","doi-asserted-by":"crossref","unstructured":"[1]A.\u00a0Attanasio, G.\u00a0Ghiani, L.\u00a0Grandinetti, E.\u00a0Guerriero and F.\u00a0Guerriero, Operations research methods for resource management and scheduling in a computational grid: A survey, in: Grid Computing the New Frontier of High Performance Computing, L.\u00a0Grandinetti, ed., Advances in Parallel Computing, Vol.\u00a014, North-Holland, 2005, pp.\u00a053\u201381.","DOI":"10.1016\/S0927-5452(05)80006-1"},{"key":"10.3233\/JCS-150535_ref2","doi-asserted-by":"crossref","unstructured":"[2]E.\u00a0Bangerter, J.\u00a0Camenisch and U.M.\u00a0Maurer, Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order, in: Proceedings of the 8th International Conference on Theory and Practice in Public Key Cryptography, PKC\u201905, Springer, Berlin, Heidelberg, 2005, pp.\u00a0154\u2013171.","DOI":"10.1007\/978-3-540-30580-4_11"},{"key":"10.3233\/JCS-150535_ref3","unstructured":"[3]F.\u00a0Brandt, A verifiable, bidder-resolved auction protocol, in: Proceedings of the 5th AAMAS Workshop on Deception, Fraud and Trust in Agent Societies, R.\u00a0Falcone, S.\u00a0Barber, L.\u00a0Korba and M.\u00a0Singh, eds, 2002, pp.\u00a018\u201325."},{"key":"10.3233\/JCS-150535_ref4","doi-asserted-by":"crossref","unstructured":"[4]F.\u00a0Brandt, Fully private auctions in a constant number of rounds, in: Financial Cryptography 2003, LNCS, Vol.\u00a02742, Springer, 2003, pp.\u00a0223\u2013238.","DOI":"10.1007\/978-3-540-45126-6_16"},{"key":"10.3233\/JCS-150535_ref5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10207-006-0001-y","article-title":"How to obtain full privacy in auctions","volume":"5","author":"Brandt","year":"2006","journal-title":"International Journal of Information Security"},{"key":"10.3233\/JCS-150535_ref6","doi-asserted-by":"crossref","unstructured":"[6]M.\u00a0Burmester, Y.\u00a0Desmedt, F.\u00a0Piper and M.\u00a0Walker, A general zero-knowledge scheme, in: Advances in Cryptology\u00a0\u2013 EUROCRYPT\u201989, Houthalen, Belgium, April 1989, LNCS, Vol.\u00a0434, Springer, 1989, pp.\u00a0122\u2013133.","DOI":"10.1007\/3-540-46885-4_15"},{"issue":"13\u201315","key":"10.3233\/JCS-150535_ref7","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1002\/cpe.690","article-title":"Economic models for resource management and scheduling in grid computing","volume":"14","author":"Buyya","year":"2002","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"10.3233\/JCS-150535_ref8","doi-asserted-by":"crossref","unstructured":"[8]D.\u00a0Chaum, J.-H.\u00a0Evertse and J.\u00a0van de Graaf, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, in: Advances in Cryptology\u00a0\u2013 EUROCRYPT\u201987, Amsterdam, The Netherlands, 13\u201315 April 1987, LNCS, Vol.\u00a0304, 1987, pp.\u00a0127\u2013141.","DOI":"10.1007\/3-540-39118-5_13"},{"key":"10.3233\/JCS-150535_ref9","doi-asserted-by":"crossref","unstructured":"[9]D.\u00a0Chaum, J.H.\u00a0Evertse, J.\u00a0van de Graaf and R.\u00a0Peralta, Demonstrating possession of a discrete logarithm without revealing it, in: CRYPTO\u201986, LNCS, Vol.\u00a0263, Springer, 1986, pp.\u00a0200\u2013212.","DOI":"10.1007\/3-540-47721-7_14"},{"key":"10.3233\/JCS-150535_ref10","doi-asserted-by":"crossref","unstructured":"[10]D.\u00a0Chaum and T.P.\u00a0Pedersen, Wallet databases with observers, in: Crypto\u201992, LNCS, Vol.\u00a0740, Springer, California, USA, 1992, pp.\u00a089\u2013105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"10.3233\/JCS-150535_ref11","doi-asserted-by":"crossref","unstructured":"[11]S.S.M.\u00a0Chow, C.\u00a0Ma and J.\u00a0Weng, Zero-knowledge argument for simultaneous discrete logarithms, in: COCOON, M.T.\u00a0Thai and S.\u00a0Sahni, eds, LNCS, Vol.\u00a06196, Springer, 2010, pp.\u00a0520\u2013529.","DOI":"10.1007\/978-3-642-14031-0_55"},{"key":"10.3233\/JCS-150535_ref12","doi-asserted-by":"crossref","unstructured":"[12]R.\u00a0Cramer and I.\u00a0Damg\u00e5rd, Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?, in: Advances in Cryptology\u00a0\u2013 CRYPTO\u201998, H.\u00a0Krawczyk, ed., LNCS, Vol.\u00a01462, Springer, Berlin, Heidelberg, 1998, pp.\u00a0424\u2013441.","DOI":"10.1007\/BFb0055745"},{"key":"10.3233\/JCS-150535_ref13","doi-asserted-by":"crossref","unstructured":"[13]B.\u00a0Curtis, J.\u00a0Pieprzyk and J.\u00a0Seruga, An efficient eAuction protocol, in: ARES, IEEE Computer Society, 2007, pp.\u00a0417\u2013421.","DOI":"10.1109\/ARES.2007.37"},{"key":"10.3233\/JCS-150535_ref14","doi-asserted-by":"crossref","unstructured":"[14]J.\u00a0Dreier, J.-G.\u00a0Dumas and P.\u00a0Lafourcade, Brandt\u2019s fully private auction protocol revisited, in: Proceedings of the 6th International Conference on Cryptology in Africa, AfricaCrypt\u20192013, Cairo, Egypt, June 2013, LNCS, Vol.\u00a07918, 2013, pp.\u00a088\u2013106.","DOI":"10.1007\/978-3-642-38553-7_5"},{"key":"10.3233\/JCS-150535_ref15","doi-asserted-by":"crossref","unstructured":"[15]T.\u00a0ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in: Proceedings of CRYPTO 84 on Advances in Cryptology, Springer, New York, NY, USA, 1985, pp.\u00a010\u201318.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"10.3233\/JCS-150535_ref16","doi-asserted-by":"crossref","unstructured":"[16]A.\u00a0Fiat and A.\u00a0Shamir, How to prove yourself: Practical solutions to identification and signature problems, in: CRYPTO, A.M.\u00a0Odlyzko, ed., LNCS, Vol.\u00a0263, Springer, 1986, pp.\u00a0186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"issue":"2","key":"10.3233\/JCS-150535_ref17","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.3233\/JCS-150535_ref18","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s00145-009-9045-2","article-title":"Efficient non-malleable commitment schemes","volume":"22","author":"Fischlin","year":"2009","journal-title":"Journal of Cryptology"},{"key":"10.3233\/JCS-150535_ref20","unstructured":"[20]V.\u00a0Krishna, Auction Theory, Academic Press, San Diego, USA, 2002."},{"key":"10.3233\/JCS-150535_ref21","doi-asserted-by":"crossref","unstructured":"[21]U.\u00a0Maurer, Unifying zero-knowledge proofs of knowledge, in: Progress in Cryptology\u00a0\u2013 AFRICACRYPT 2009, B.\u00a0Preneel, ed., LNCS, Vol.\u00a05580, Springer, Berlin, Heidelberg, 2009, pp.\u00a0272\u2013286.","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"10.3233\/JCS-150535_ref22","doi-asserted-by":"crossref","unstructured":"[22]M.\u00a0Naor, B.\u00a0Pinkas and R.\u00a0Sumner, Privacy preserving auctions and mechanism design, in: ACM Conference on Electronic Commerce, 1999, pp.\u00a0129\u2013139.","DOI":"10.1145\/336992.337028"},{"key":"10.3233\/JCS-150535_ref23","doi-asserted-by":"crossref","unstructured":"[23]K.\u00a0Omote and A.\u00a0Miyaji, A practical English auction with one-time registration, in: ACISP, V.\u00a0Varadharajan and Y.\u00a0Mu, eds, LNCS, Vol.\u00a02119, 2001, pp.\u00a0221\u2013234.","DOI":"10.1007\/3-540-47719-5_19"},{"key":"10.3233\/JCS-150535_ref24","doi-asserted-by":"crossref","unstructured":"[24]K.\u00a0Peng, C.\u00a0Boyd, E.\u00a0Dawson and K.\u00a0Viswanathan, Robust, privacy protecting and publicly verifiable sealed-bid auction, in: ICICS, R.H.\u00a0Deng, S.\u00a0Qing, F.\u00a0Bao and J.\u00a0Zhou, eds, LNCS, Vol.\u00a02513, Springer, 2002, pp.\u00a0147\u2013159.","DOI":"10.1007\/3-540-36159-6_13"},{"key":"10.3233\/JCS-150535_ref25","doi-asserted-by":"crossref","unstructured":"[25]A.-R.\u00a0Sadeghi, M.\u00a0Schunter and S.\u00a0Steinbrecher, Private auctions with multiple rounds and multiple items, in: DEXA Workshops, IEEE, 2002, pp.\u00a0423\u2013427.","DOI":"10.1109\/DEXA.2002.1045932"},{"key":"10.3233\/JCS-150535_ref26","doi-asserted-by":"crossref","unstructured":"[26]K.\u00a0Sako, An auction protocol which hides bids of losers, in: Public Key Cryptography, H.\u00a0Imai and Y.\u00a0Zheng, eds, LNCS, Vol.\u00a01751, Springer, 2000, pp.\u00a0422\u2013432.","DOI":"10.1007\/978-3-540-46588-1_28"},{"key":"10.3233\/JCS-150535_ref27","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":"Journal of Cryptology"}],"container-title":["Journal of Computer Security"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCS-150535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:15:11Z","timestamp":1748697311000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/JCS-150535"}},"subtitle":[],"editor":[{"given":"Luca","family":"Spalazzi","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vigan\u00f2","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2015,9,29]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/jcs-150535","relation":{},"ISSN":["1875-8924","0926-227X"],"issn-type":[{"type":"electronic","value":"1875-8924"},{"type":"print","value":"0926-227X"}],"subject":[],"published":{"date-parts":[[2015,9,29]]}}}