E. Bangerter, J. Camenisch, and U. M. Maurer, Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order, Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography, PKC'05, pp.154-171, 2005.
DOI : 10.1007/978-3-540-30580-4_11

F. Brandt, A verifiable, bidder-resolved auction protocol, Proceedings of the 5th AAMAS Workshop on Deception, Fraud and Trust in Agent Societies, pp.18-25, 2002.

F. Brandt, Fully Private Auctions in a Constant Number of Rounds, Financial Cryptography 2003, pp.223-238, 2003.
DOI : 10.1007/978-3-540-45126-6_16

F. Brandt, How to obtain full privacy in auctions, International Journal of Information Security, vol.16, issue.1, pp.201-216, 2006.
DOI : 10.1007/s10207-006-0001-y

M. Burmester, Y. Desmedt, F. Piper, and M. Walker, A general zeroknowledge scheme, Advances in Cryptology -EUROCRYPT '89, pp.122-133, 1989.

D. Chaum, J. H. Evertse, J. Van-de-graaf, and R. Peralta, Demonstrating Possession of a Discrete Logarithm Without Revealing it, CRYPTO'86, pp.200-212, 1986.
DOI : 10.1007/3-540-47721-7_14

D. Chaum, J. Evertse, and J. Van-de-graaf, An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations, Advances in Cryptology -EUROCRYPT '87, pp.127-141, 1987.
DOI : 10.1007/3-540-39118-5_13

D. Chaum and T. P. Pedersen, Wallet Databases with Observers, Crypto'92, pp.89-105, 1992.
DOI : 10.1007/3-540-48071-4_7

S. M. Sherman, C. Chow, J. Ma, and . Weng, Zero-knowledge argument for simultaneous discrete logarithms, LNCS, vol.6196, pp.520-529, 2010.

R. Cramer and I. Damgård, Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?, Advances in Cryptology CRYPTO '98, pp.424-441, 1998.
DOI : 10.7146/brics.v4i27.18953

B. Curtis, J. Pieprzyk, and J. Seruga, An Efficient eAuction Protocol, The Second International Conference on Availability, Reliability and Security (ARES'07), pp.417-421, 2007.
DOI : 10.1109/ARES.2007.37

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, LNCS, vol.263, pp.186-194, 1986.
DOI : 10.1007/3-540-47721-7_12

M. J. Fischer, N. A. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

M. Fischlin and R. Fischlin, Efficient Non-malleable Commitment Schemes, Journal of Cryptology, vol.4, issue.4, pp.530-571, 2009.
DOI : 10.1007/s00145-009-9045-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.2777

J. Katz, Efficient cryptographic protocols preventing " man-in-themiddle " attacks, 2002.

V. Krishna, Auction Theory, 2002.

U. Maurer, Unifying Zero-Knowledge Proofs of Knowledge, Progress in Cryptology AFRICACRYPT 2009, pp.272-286, 2009.
DOI : 10.1145/359340.359342

M. Naor, B. Pinkas, and R. Sumner, Privacy preserving auctions and mechanism design, Proceedings of the 1st ACM conference on Electronic commerce , EC '99, pp.129-139, 1999.
DOI : 10.1145/336992.337028
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7459

K. Omote and A. Miyaji, A Practical English Auction with One-Time Registration, LNCS, vol.2119, pp.221-234, 2001.
DOI : 10.1007/3-540-47719-5_19

K. Peng, C. Boyd, E. Dawson, and K. Viswanathan, Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction, ICICS, volume 2513 of LNCS, pp.147-159, 2002.
DOI : 10.1007/3-540-36159-6_13

A. Sadeghi, M. Schunter, and S. Steinbrecher, Private auctions with multiple rounds and multiple items, Proceedings. 13th International Workshop on Database and Expert Systems Applications, pp.423-427, 2002.
DOI : 10.1109/DEXA.2002.1045932

K. Sako, An Auction Protocol Which Hides Bids of Losers, Public Key Cryptography, pp.422-432, 2000.
DOI : 10.1007/978-3-540-46588-1_28

C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991.
DOI : 10.1007/BF00196725
URL : http://publikationen.ub.uni-frankfurt.de/files/4280/schnorr.pdf