![](bga.png)
son, 1999) does not provide anonymity for the bid-
ders and requires all parties to trust a public Notary.
The scheme by (Omote and Miyaji, 2001) does not
prevent an Auctioneer from skewing his/her clock or
from blocking bids.
In direct contrast, our scheme solves all of the prob-
lems of the existing schemes and has a more compre-
hensive set of security requirements. We use a group
signature to provide verification of bids and to pro-
tect the identities of bidders. The group signature is
modified so that the identity of a bidder is divided
among two separate parties (i.e., the anonymity sub-
system). The role of the Auctioneer is also divided
among two parties to prevent clock-skewing and bid-
blocking (i.e., the auction subsystem). The scheme
has comparable efficiency to the existing proposal for
its enhanced security and privacy characteristics. The
efficiency and security of the scheme rests with the
underlying group signature scheme used. Our ap-
proach offers the client flexibility in choosing from
any group signature scheme. The scheme offers effi-
cient one-time registration and revocation procedures
that are clearly better suited to handling multiple auc-
tions than existing proposals.
REFERENCES
Ateniese, G., Camenisch, J., Joye, M. and Tsudik, G.
(2000). A practical and provably secure coalition se-
cure coalition-resistant group signature scheme in Ad-
vances in Cryptology - Proceedings of CRYPTO 2000,
vol. 1880 of Lecture Notes in Computer Science,
Springer-Verlag, 255-270.
Ateniese, G., Song, D. and Tsudik, G. (2002). Quasi-
Efficient Revocation of Group Signatures, in Proceed-
ings of Financial Cryptography, vol. 2357 of Lecture
Notes in Computer Science, Springer-Verlag, 183-
197.
Boyd, C. and Mao, W. (2000). Security Issues for Elec-
tronic Auctions, Technical Report, Hewlett Packard,
TR-HPL-2000-90.
Camenisch, J. and Lysyanskaya, A. (2002). Dynamic Ac-
cumulators and Application to Efficient Revocation of
Anonymous Credentials, in Advances in Cryptology -
Proceedings of CRYPTO 2002, vol. 2442 of Lecture
Notes in Computer Science, Springer-Verlag, 61-76.
Camenisch, J. and Stadler, M. (1997). Efficient Group
Signature Scheme for Large Groups, in Advances
in Cryptology - Proceedings of CRYPTO ’97, vol.
1294 of Lecture Notes in Computer Science, Springer-
Verlag, 410-424.
Chaum, D. and van Heyst, E. (1991). Group Signatures,
in Advances in Cryptology - Proceedings of EURO-
CRYPT’91, vol. 547 of Lecture Notes in Computer
Science, Springer-Verlag, 257-265.
Franklin, M. and Reiter, M. (1996). The Design and Imple-
mentation of a Secure Auction Service, IEEE Trans-
actions on Software Engineering, vol. 22, 302-312.
Kumar, M. and Feldman, S. (1998). Internet Auctions, in
Proceedings of the Third USENIX Workshop on Elec-
tronic Commerce, 49-60.
Lee, B., Kim, K. and Ma, J. (2001). Efficient Public Auc-
tion with One-time Registration and Public Verifiabil-
ity, in International Conference on Cryptology in In-
dia - Proceedings of INDOCRYPT 2001, vol. 2247 of
Lecture Notes in Computer Science, Springer-Verlag,
162-174.
Naor, M., Pinkas, B. and Sumner, R. (1999). Privacy Pre-
serving Auctions and Mechanism Design, in The 1st
ACM Conference on Electronic Commerce, 129-139.
Nguyen, K. and Traore, J. (2000). An On-line Public Auc-
tion Protocol Protecting Bidder Privacy, in Proceed-
ings of ACSIP 2000 - Australasian Conference on In-
formation Security and Privacy, vol. 1841 of Lecture
Notes in Computer Science, Springer-Verlag, 427-
442.
Omote, K. and Miyaji, A. (2001). A Practical English Auc-
tion with One-Time Registration, in Proceedings of
ACSIP 2001 - Australasian Conference on Informa-
tion Security and Privacy, vol. 2119 of Lecture Notes
in Computer Science, Springer-Verlag, 221-234.
Stubblebine, S. and Syverson, P. (1999). Fair On-line Auc-
tions Without Special Trusted Parties, in Proceed-
ings of Financial Cryptography 1999, vol. 1648 of
Lecture Notes in Computer Science, Springer-Verlag,
230-240.
Tsudik, G. and Xu, S. (2003). Accumulating Composites
and Improved Group Signing, in Advances in Cryptol-
ogy - Proceedings of ASIACRYPT 2003, vol. 2894 of
Lecture Notes in Computer Science, Springer-Verlag,
269-286.
Trevathan, J. (2005). Security, Anonymity and Trust in
Electronic Auctions, Association for Computing Ma-
chinery Crossroads, Spring Edition, 3-9, vol. 11.3.
Trevathan, J., Ghodosi, H. and Read, W. (2005). Design
Issues for Electronic Auctions, in 2nd International
Conference on E-Business and Telecommunication
Networks, 340-347.
Trevathan, J., Ghodosi, H. and Read, W. (2006). An
Anonymous and Secure Continuous Double Auction
Scheme, in 39th International Hawaii Conference on
System Sciences, 125(1-12).
Viswanathan, K., Boyd, C. and Dawson, E. (2000). A
Three Phased Schema for Sealed Bid Auction System
Design, Proceedings of ACSIP 2000 - Australasian
Conference on Information Security and Privacy, vol.
1841 of Lecture Notes in Computer Science, Springer-
Verlag, 412-426.
SECRYPT 2006 - INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY
396