Operations research methods for resource management and scheduling in a computational grid: a survey Grid Computing The New Frontier of High Performance Computing, of Advances in Parallel Computing, pp.53-81, 2005. ,
Economic models for resource management and scheduling in grid computing. Concurrency and Computation: Practice and Experience, pp.13-151507, 2002. ,
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
A General Zero-Knowledge Scheme, Advances in Cryptology - EUROCRYPT '89, pp.122-133, 1989. ,
DOI : 10.1007/3-540-46885-4_15
A verifiable, bidder-resolved auction protocol, Proceedings of the 5th AAMAS Workshop on Deception, Fraud and Trust in Agent Societies, pp.18-25, 2002. ,
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
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
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.1007/BFb0055745
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations, Advances in Cryptology -EU- ROCRYPT '87, pp.127-141, 1987. ,
DOI : 10.1007/3-540-39118-5_13
Demonstrating possession of a discrete logarithm without revealing it, CRYPTO'86, pp.200-212, 1986. ,
Zeroknowledge argument for simultaneous discrete logarithms, LNCS, vol.6196, pp.520-529, 2010. ,
Wallet Databases with Observers, Crypto'92, pp.89-105, 1992. ,
DOI : 10.1007/3-540-48071-4_7
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
Brandt???s fully private auction protocol revisited, Proceedings of the 6th International Conference on Cryptology in Africa, pp.88-106, 2013. ,
DOI : 10.3233/JCS-150535
Efficient Non-malleable Commitment Schemes, Journal of Cryptology, vol.4, issue.4, pp.530-571, 2009. ,
DOI : 10.1007/s00145-009-9045-2
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, LNCS, vol.263, pp.186-194 ,
DOI : 10.1007/3-540-47721-7_12
Efficient cryptographic protocols preventing "manin-the-middle" attacks, 2002. ,
Auction Theory, 2002. ,
Unifying Zero-Knowledge Proofs of Knowledge, Progress in Cryptology â ? A¸SA¸S AFRICACRYPT 2009, pp.272-286, 2009. ,
DOI : 10.1145/359340.359342
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
A Practical English Auction with One-Time Registration, LNCS, vol.2119, pp.221-234, 2001. ,
DOI : 10.1007/3-540-47719-5_19
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
An Auction Protocol Which Hides Bids of Losers, Public Key Cryptography, pp.422-432, 2000. ,
DOI : 10.1007/978-3-540-46588-1_28
Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991. ,
DOI : 10.1007/BF00196725
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