G - 16th workshop on Elliptic Curve Cryptography
G - 16th workshop on Elliptic Curve Cryptography
G - 16th workshop on Elliptic Curve Cryptography
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
References<br />
[BN05] P. Barreto and M. Naehrig, “Pairing-friendly <strong>Elliptic</strong> <strong>Curve</strong>s of Prime Order”,<br />
SAC 2005, LNCS 3897, pp. 319-331, Springer, 2006.<br />
[BF01]<br />
D. B<strong>on</strong>eh and M. Franklin, “Identity-based Encrypti<strong>on</strong> from the Weil Pairing”,<br />
CRYPTO 2001, LNCS 2139, pp. 213-229, Springer, 2001.<br />
[BGW05] D. B<strong>on</strong>eh, C. Gentry, and B. Waters, “Collusi<strong>on</strong> Resistant Broadcast Encrypti<strong>on</strong><br />
with Short Ciphertext and Private Keys”, CRYPTO 2005, LNCS 3621, pp. 258-<br />
275, Springer, 2005.<br />
[ElGamal84] T. El-Gamal, “ A public-key cryptosystem and a signature scheme based <strong>on</strong><br />
discrete logarithms”,CRYPTO 1984, LNCS196, Springer-Verlag, pp. 10-18,<br />
1985.<br />
[FK00]<br />
W. Ford and B. Kaliski, “Server-assisted generati<strong>on</strong> of a str<strong>on</strong>g secret from a<br />
password”, Nineth internati<strong>on</strong>al <str<strong>on</strong>g>workshop</str<strong>on</strong>g> <strong>on</strong> enabling technologies - wet ice<br />
2000, IEEE Press, 2000.<br />
[EUROCRYPT06] J.H. Che<strong>on</strong>, “Security Analysis of Str<strong>on</strong>g Diffie-Hellman Problem”,<br />
EUROCRYPT 2006, LNCS 4004, pp. 1-11, Springer, 2006.<br />
[AINA11] T. Izu, M. Takenaka, and M. Yasuda, “Experimental Analysis of Che<strong>on</strong>’s<br />
Algorithm against Pairing-Friendly <strong>Curve</strong>s”, AINA 2011, pp. 90-96, IEEE<br />
Computer Science, 2011.<br />
51<br />
Copyright 2012 FUJITSU LABORATORIES Ltd.
Change language