An auction protocol which hides bids of losers

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

Volumn 1751, Issue , 2000, Pages 422-432

  Sako, Kazue ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Auction; Group decryption; Privacy

Indexed keywords

CHROMIUM COMPOUNDS; DATA PRIVACY;

AUCTION; AUCTION PROTOCOLS; COMPACT REPRESENTATION; ELGAMAL CRYPTOSYSTEM; GROUP DECRYPTION; PRACTICAL SCHEMES; PROBABILISTIC ENCRYPTION; RSA CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 35248870807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46588-1_28     Document Type: Conference Paper

References (15)

1. Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology — CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 13-25, 1998.
2. [] D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In STOC '91.
3. Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology — CRYPTO '84, volume 196 of Lecture Notes in Computer Science, pages 10-18, 1984.
4. Y. Frankel, P. MacKenzie and M. Yung, Robust efficient distributed RSA-key generation. In STOC98, pp.663-672, 1998.
5. [] Matthew Franklin and Michael Reiter. The design and implementation of a secure auction service. In IEEE Transactions on Software Engineering, No.22, Vol.5, pages 302-312, 1996.
6. [] Rosario Gennaro, Shai Halevi and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Eurocrypt99, 1999.
7. [] Michael Harkavy, Doug Tyger, Hiroaki Kikuchi. Electronic auctions with private bids. In Third USENIX Workshop on Electronic Commerce, 1998.
8. [KHT98] Hiroaki Kikuchi, Michael Harkavy, Doug Tyger. Multi-round anonymous auction protocols. In IEEE Workshop on Dependable and Real-Time E-Commerce System1998.
9. [] Kunio Kobayashi and Hikaru Morita. Efficient sealed-bid auction with quantitative competition using one-way functions. In Technical Report of IEICE, ISECMay 1999.
10. [] M. Michels and M. Stadler. Efficient convertible undeniable signature schemes. In Proc. 4th Annual Workshop on Selected Areas in Cryptograph, SAC'97, 1997.
11. [] Shingo Miyazaki and Kouichi Sakurai. Notes on threshold schemes in the distributed RSA Cryptosystem. In the 1999 Symposium on Cryptography and Information Security, pp.451-456, 1998.
12. Ped91[] Torben P. Pedersen. A threshold cryptosystem without a trusted party (extended abstract). In Advances in Cryptology — EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 522-526, 1991.
13. RSA[] Ronald Rivest, Adi Shamir and Len Adleman. A method for obtaining digital signature and public-key cryptosystems. In Communications of the ACM, Vol.21, No.2, pages 120-126. 1978.
14. [] Kouichi Sakurai and Shingo Miyazaki. A bulletin-board based digital auction scheme with bidding down strategy -towards anonymous electronic bidding without anonymous channels nor trusted centersin Cryptographic Techniques and E-Commerce, Proceedings of the 1999 International Workshop on Cryptographic Techniques and E-Commerce(CryTEC '99)1999.
15. Sha79[] Adi Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.