Efficient homomorphic sealed-bid auction free of bid validity check and equality test

Security and Communication Networks

Volumn 7, Issue 1, 2014, Pages 64-76

  Peng, Kun ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Bid validity check; High efficiency; Homomorphic auction

Indexed keywords

COMPUTER NETWORKS; INFORMATION SYSTEMS;

BID VALIDITY CHECK; BINARY SEARCH; E-AUCTIONS; EQUALITY TESTS; HIGH-EFFICIENCY; HOMOMORPHIC AUCTION; SEALED-BID AUCTIONS; SENSITIVE APPLICATION;

EFFICIENCY;

EID: 84894090297     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.549     Document Type: Article

References (28)

1. Abe M, Suzuki K. Receipt-free sealed-bid auction. In ISC 2002, volume 2433 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2002; 191-199.
2. Boneh D, Boyen X. Short signatures without random oracles. In Eurocrypt '04, LNCS3027 56-73.
3. B Felix. Cryptographic protocols for secure second-price auctions. 2001. Available from http://www.cs.miami.edu/~burt/learning/Csc498.043/cia2001.pdf.
4. Christian C. Efficient private bidding and auctions with an oblivious third partyIn. In the 6th ACM Conference on Computer and Communications Security. 1999.
5. Chida K, Kobayashi K, Morita H. Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In Information Security, 4th International Conference, ISC 200, volume 2200 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2001; 408-419.
6. Cramer R, Damgård I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, volume 839 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 1994; 174-187.
7. Cramer R, Damgård I, Nielsen JB. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT '01, volume 2045 of Lecture Notes in Computer Science, Springer: Berlin, 2001; 280-299.
8. Fouque P-A, Poupard G, Stern J. Sharing decryption in the context of voting or lotteries. In Financial Cryptography 2000, volume 1962, Springer-Verlag: Berlin, 2000; 90-104. Lecture Notes in Computer Science.
9. Wasser SG, Micali S. Probabilistic encryption. Journal of Computer Security 1984; 28(2):270-299.
10. Guillou LC, Quisquater JJ. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. In CRYPTO '88, volume 403 of Lecture Notes in Computer Science, Goldwasser S (ed). Springer-Verlag: Berlin, 1989; 216-231.
11. Jakobsson M, Juels A. Mix and match: secure function evaluation via ciphertexts. In ASIACRYPT '00, volume 1976 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2000; 143-161.
12. Juels A, Szydlo M. A two-server, sealed-bid auction protocol. In The Sixth International Conference on Financial Cryptography 2002, volume 2357 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2002; 72-86.
13. Kikuchi H, Harkavy M, Tygar JD. Multi-round anonymous auction. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems. 1998; 62-69.
14. Kikuchi H, Hotta S, Abe K, Nakanishi S. Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In Proceedings of the International Workshop on Next Generation Internet (NGITA2000), IEEE. 2000; 307-312.
15. Kikuchi H. (m+1)st-price auction. In The Fifth International Conference on Financial Cryptography 2001, volume 2339 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2001; 291-298.
16. Kurosawa K, Ogata W. Bit-slice auction circuit. In 7th European Symposium on Research in Computer Security, ESORICS2002, volume 2502 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2002; 24-38.
17. Naor M, Pinkas B, Sumner R. Privacy preserving auctions and mechanism design. In ACM Conference on Electronic Commerce 1999. 1999; 129-139.
18. Omote K, Miyaji A. A second-price sealed-bid auction with the discriminant of the p-th root. In Financial Cryptography 2002, volume 2357 of Lecture Notes in Computer Science. Springer: Berlin, 2002; 57-71.
19. Peng K, Boyd C, Dawson E, Viswanathan K. Non-interactive auction scheme with strong privacy. In 5th International Conference of Information Security and Cryptology-ICISC 2002, volume 2587 of Lecture Notes in Computer Science. Springer: Berlin, 2002; 407-420.
20. Peng K, Boyd C, Dawson E, Viswanathan K. Robust, privacy protecting and publicly verifiable sealed-bid auctionIn. In 4th International Conference of Information and Communications Security, ICICS 2002, volume 2513 of Lecture Notes in Computer Science. Springer: Berlin, 2002; 147-159.
21. Peng K, Boyd C, Dawson E. Batch verification of validity of bids in homomorphic e-auction. Computer Communications 2006; 29(2006):2798-2805.
22. Peng K, Dawson E. Efficient bid validity check in elgamal-based sealed-bid e-auctionIn. In ISPEC 2007, volume 4464 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2007; 209-224.
23. Peng K, Bao F. Efficiency improvement of homomorphic e-auctionIn. In TRUSTBUS 2010, volume 6264 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2010; 238-249.
24. Peng K. Secure e-auction for mobile users with low-capability devices in wireless networksIn. In WISTP 2011, volume 6633 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2011; 351-360.
25. Sako K. An auction scheme which hides the bids of losersIn. In Public Key Cryptology 2000, volume 1880 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2000; 422-432.
26. Sakurai K, Miyazaki S. A bulletin-board based digital auction scheme with bidding down strategy-towards anonymous electronic bidding without anonymous channels nor trusted centers. In Proceedings of the International Workshop on Cryptographic Techniques and E-Commerce. City University of Hong Kong Press: Hong Kong, 1999; 180-187.
27. Suzuki K, Kobayashi K, Morita H. Efficient sealed-bid auction using hash chainIn. In International Conference on Information Security and Cryptology 2000, volume 2015 of Lecture Notes in Computer Science. Springer-Verlag: Berlin, 2000; 183-191.
28. Watanabe Y, Imai H. Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP. In STOC 2000, ACM: Portland, Oregon, USA, 2000; 80-86.