Skip Navigation

IEICE Transactions on Information and Systems 2007 E90-D(3):688-691; doi:10.1093/ietisy/e90-d.3.688
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by LEE, N.-Y.
Right arrow Articles by LEE, M.-F.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2007 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Application Information Security

Web Metering Scheme Based on the Bilinear Pairings

Narn-Yih LEE1 and Ming-Feng LEE1

1 The authors are with the Information Management Department, Southern Taiwan University of Technology, Tainan County, Taiwan 710, ROC. E-mail: nylee{at}mail.stut.edu.tw

Web metering is an effective means of measuring the number of visits from clients to Web servers during a specific time frame. Naor and Pinkas, in 1998, first introduced metering schemes to evaluate the popularity of Web servers. Ogata and Kurosawa proposed two schemes that improve on the Naor-Pinkas metering schemes. This study presents a Web metering scheme which is based on the bilinear pairings and built on the GDH group. The proposed scheme can resist fraud attempts by malicious Web servers and disruptive attacks by malicious clients.

Key Words: cryptography, metering scheme, secret sharing, bilinear pairings, network security


Manuscript received August 21, 2006. Manuscript revised November 9, 2006.

References

[1] M. Naor and B. Pinkas, "Secure and efficient metering," Eurocrypt'98, pp.576–590, 1998.

[2] A. Shamir, "How to share a secret," Commun. ACM, vol.22, pp.612–613, 1979.

[3] W. Ogata and K. Kurosawa, "Provably secure metering scheme," Asiacrypt'00, pp.338–398, 2000.

[4] B. Masucci and D.R. Stinson, "Metering schemes for general access structures," ESORICS 2000, LNCS, vol.1895, pp.612–613, 2000.

[5] B. Masucci and D.R. Stinson, "Efficient metering schemes with pricing," IEEE Trans. Inf. Theory, vol.47, no.7, pp.2835–2844, 2001.

[6] L. Harn and H.Y. Lin, "A non-repudiation metering scheme," IEEE Commun. Lett., vol.5, no.12, pp.486–487, 2001.

[7] D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," Crypto'01, pp.213–229, 2001.

[8] N.P. Smart, "An ID-based authenticated key agreement protocol based on the Weil pairing," Electron. Lett., vol.39, no.14, pp.630–632, 2002.

[9] K. Shim, "Efficient one round tripartite authentication from the Weil pairing," Electron. Lett., vol.39, no.2, pp.208–209, 2003.

[10] J.C. Cha and J.H. Cheon, "An identity-based signature from gap Diffie-Hellman groups," PKC'03, pp.18–30, 2003.

[11] D. Vo, F. Zhang, and K. Kim, "A new threshold blind signature from pairings," SCIS 2003, pp.233–238, 2003.

[12] Z. Li, J. Higgins, and M. Clement, "Performance of finite field aruthmetic in an elliptic curve cryptosystem," Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication System, pp.249–256, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by LEE, N.-Y.
Right arrow Articles by LEE, M.-F.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?