http://iet.metastore.ingenta.com
1887

Efficient proof of bid validity with untrusted verifier in homomorphic e-auction

Efficient proof of bid validity with untrusted verifier in homomorphic e-auction

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Bid validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-auction. The existing bid validity proof technique is inefficient and only achieves honest-verifier zero knowledge (ZK). In this study, an efficient proof and verification technique is proposed to guarantee bid validity in homomorphic e-auction. The new proof technique is mainly based on hash function operations and only needs a very small number of costly public key cryptographic operations. Moreover, it can handle untrusted verifiers and achieve perfect ZK. As a result, efficiency and privacy of homomorphic e-auction applications are significantly improved. To the best of authors’ knowledge, it proof technique is the first to handle untrusted verifiers in e-auction applications.

References

    1. 1)
      • Kikuchi, H., Harkavy, M., Tygar, J.D.: `Multi-round anonymous auction', Proc. First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, June 1998, p. 62–69.
    2. 2)
      • Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: `Distributed auction servers resolving winner and winning bid without revealing privacy of bids', Proc. Int. Workshop on Next Generation Internet (NGITA2000), July 2000, p. 307–312.
    3. 3)
      • Chida, K., Kobayashi, K., Morita, H.: `Efficient sealed-bid auctions for massive numbers of bidders with lump comparison', Proc. Fourth Int. Information Security Conf., (ISC 2001), 2001, p. 408–419(LNCS, 2200), .
    4. 4)
      • Kikuchi, H.: `(', Fifth Int. Conf. on Financial Cryptography 2001, 2001, p. 291–298(LNCS, 2339), .
    5. 5)
      • M. Abe , K. Suzuki . Receipt-free sealed-bid auction. ISC 2002 , 191 - 199
    6. 6)
      • Brandt, F.: Cryptographic protocols for secure second-price auctions, 2001, Available at http://www.brauer.in.tum.de/~brandtf/papers/cia2001.pdf.
    7. 7)
    8. 8)
      • Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: `Robust, privacy protecting and publicly verifiable sealed-bid auction', Fourth Int. Conf. on Information and Communications Security, (ICICS 2002), 2002, p. 147–159(LNCS, 2513), .
    9. 9)
      • R. Cramer , I. Damgard , B. Schoenmakers . Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO'94 LNCS , 174 - 187
    10. 10)
      • Peng, K., Boyd, C., Dawson, E.: `A multiplicative homomorphic sealed-bid auction based on Goldwasser-Micali encryption', ISC 2005, 2005, p. 374–388(LNCS, 3650), .
    11. 11)
    12. 12)
    13. 13)
      • K. Peng , E. Dawson . Efficient bid validity check in elgamal-based sealed-bid e-auction. ISPEC 2007 , 209 - 224
    14. 14)
      • K. Peng , F. Bao . Efficiency improvement of homomorphic e-auction. TRUSTBUS'10 LNCS , 238 - 249
    15. 15)
      • K. Peng . Secure e-auction for mobile users with low-capability devices in wireless network. WISTP'11 , 351 - 360
    16. 16)
      • Peng, K., Bao, F.: `Efficient proof of validity of votes in homomorphic e-voting', Int. Conf. on Network and System Security (NSS'10), 2010, p. 17–23.
    17. 17)
      • D. Boneh , X. Boyen . Short signatures without random oracles. Eurocrypt'04 , 56 - 73
    18. 18)
      • D. Chaum , J. Evertse , J. Graaf . An improved protocol for demonstrating possession of discrete logarithms and some generalizations. EUROCRYPT'87 , 127 - 141
    19. 19)
      • I. Damgård . Efficient concurrent zero-knowledge in the auxiliary string model. EURO-CRYPT'00 , 431 - 444
    20. 20)
    21. 21)
      • K. Peng , F. Bao . An efficient range proof scheme. IEEE PASSAT'10 , 826 - 833
    22. 22)
      • Sakurai, K., Miyazaki, S.: `A bulletin-board based digital auction scheme with bidding down strategy – towards anonymous electronic bidding without anonymous channels non trusted centers', Proc. Int. Workshop on Cryptographic Techniques and e-Commerce, 1999, p. 180–187.
    23. 23)
      • Suzuki, K., Kobayashi, K., Morita, H.: `Efficient sealed-bid auction using hash chain', Int. Conf. on Information Security and Cryptology 2000, 2000, p. 183–191, (LNCS 2015).
    24. 24)
      • Y. Watanabe , H. Imai . Reducing the round complexity of a sealed-bid auction protocol with an off-line ttp. STOC 2000, ACM , 80 - 86
    25. 25)
      • K. Sako . An auction scheme which hides the bids of losers. Public Key Cryptology 2000 , 422 - 432
    26. 26)
      • Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: `Non-interactive auction scheme with strong privacy', Fifth Int. Conf. on Information Security and Cryptology (ICISC 2002), 2002, p. 407–420, LNCS 2587.
    27. 27)
    28. 28)
      • T. Okamoto , S. Uchiyama . A new public-key encyptosystem as secure as factoring. CRYPTO'98 , 308 - 318
    29. 29)
      • Naccache, D., Stern, J.: `A new public key cryptosystem based on higher residues', ACM Computer Science Conf. 1998, 1998, p. 160–174.
    30. 30)
      • P. Paillier . Public key cryptosystem based on composite degree residuosity classes. EURO-CRYPT'99 , 223 - 238
    31. 31)
      • D. Boneh , M. Franklin . Efficient generation of shared RSA keys. Crypto'97 , 425 - 439
    32. 32)
      • P. MacKenzie , Y. Frankel , M. Yung . (1998) Robust efficient distributed RSA-key generation.
    33. 33)
      • I. Damgård , M. Koprowski . Practical threshold RSA signatures without a trusted dealer. EUROCRYPT'01 , 152 - 165
    34. 34)
      • P. Feldman . A practical scheme for non-interactive verifiable secret sharing. FOCS'87 , 427 - 437
    35. 35)
      • T. Pedersen . A threshold cryptosystem without a trusted party. EUROCRYPT'91 , 522 - 526
    36. 36)
      • R. Gennaro , S. Jarecki , H. Krawczyk , T. Rabin . Secure distributed key generation for discrete-log based cryptosystems. EUROCRYPT'99 , 123 - 139
    37. 37)
      • P.-A. Fouque , G. Poupard , J. Stern . (2000) Sharing decryption in the context of voting or lotteries. Financial Cryptography 2000.
    38. 38)
    39. 39)
      • I. Damgård , M. Jurik . A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. PKC ’01 , 119 - 136
    40. 40)
      • B. Lee , K. Kim . Receipt-free electronic voting through collaboration of voter and honest verifier. JW-ISC 2000 , 101 - 108
    41. 41)
    42. 42)
      • L.C. Guillou , J.J. Quisquater , S. Goldwasser . (1989) A ‘paradoxical’ identity-based signature scheme resulting from zero-knowledge, CRYPTO'88.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2012.0076
Loading

Related content

content/journals/10.1049/iet-ifs.2012.0076
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address