Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3715 LNCS, Issue , 2005, Pages 84-98

  Peng, Kun ^a   Boyd, Colin ^a   Dawson, Ed ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA PRIVACY; PROBLEM SOLVING;

BID PRIVACY; COMPUTATION PROBLEMS; ELECTRONIC SEALED-BID AUCTION; HOMOMORPHIC SECRET SHARING; SECRET SHARING TECHNIQUES;

COMPUTER CRIME;

EID: 33646168701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_7     Document Type: Conference Paper

References (12)

1. Feng Bao. An efficient verifiable encryption scheme for encryption of discrete logarithms. In the Smart Card Research Conference, CARDIS'98, volume 1820 of Lecture Notes in Computer Science, pages 213-220, Berlin, 1998. Springer-Verlag.
2. D. Chaum and T. P. Pedersen. Wallet databases with observers. In CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89-105, Berlin, 1992. Springer-Verlag.
3. Matthew K Franklin and Michael K Reiter. The design and implementation of a secure auction service. In IEEE Transactions on Software Enginerring, volume 5, pages 302-312, May 1996.
4. H Kikuchi, Michael Harkavy, and J D Tygar. Multi-round anonymous auction. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pages 62-69, June 1998.
5. Hiroaki Kikuchi. (m+1)st-price auction. In The Fifth International Conference on Financial Cryptography 2001, volume 2339 of Lecture Notes in Computer Science, pages 291-298, Berlin, 2001. Springer-Verlag.
6. Hiroaki Kikuchi, Shinji Hotta, Kensuke Abe, and Shohachiro Nakanishi. Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In proc. of International Workshop on Next Generation Internet (NGITA2000), IEEE, pages 307-312, July 2000.
7. P Paillier. Public key cryptosystem based on composite degree residuosity classes. In EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238, Berlin, 1999. Springer-Verlag.
8. Torben P. Pedersen. Distributed provers with applications to undeniable signatures. In EUROCRYPT '91, pages 221-242, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science 547.
9. Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In EUROCRYPT '91, pages 129-140, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science 547.
10. Kun Peng, Colin Boyd, Ed Dawson, and Kapali Viswanathan. Robust, privacy protecting and publicly verifiable sealed-bid auction. In 4th International Conference of Information and Communications Security, ICICS 2002, volume 2513 of Lecture Notes in Computer Science, pages 147-159, Berlin, 2002. Springer.
11. C Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4, 1991, pages 161-174, 1991.
12. Adi Shamir. How to share a secret. Communication of the A CM, 22(11):612-613, Nov 1979.