
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jung Hee Cheon, Dong Hoon Lee, "Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations," IEEE Transactions on Computers, vol. 55, no. 12, pp. 15361542, December, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.207, author = {Jung Hee Cheon and Dong Hoon Lee}, title = {Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {12}, issn = {00189340}, year = {2006}, pages = {15361542}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.207}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations IS  12 SN  00189340 SP1536 EP1542 EPD  15361542 A1  Jung Hee Cheon, A1  Dong Hoon Lee, PY  2006 KW  Batch verification KW  modular exponentiation KW  sparse exponent KW  Frobenius map. VL  55 JA  IEEE Transactions on Computers ER   
[1] E. Brickell, D. Gordon, K. McCurley, and D. Wilson, “Fast Exponentiation with Precomputation,” Proc. Eurocrypt '92, pp.200207, 1993.
[2] M. Bellare, J. Garay, and T. Rabin, “Fast Batch Verification for Modular Exponentiation and Digital Signatures,” Proc. Eurocrypt '98, pp. 236250, 1998, http://wwwcse.ucsd.edu/usersmihir.
[3] M. Beller and Y. Yacobi, “Batch DiffieHellman Key Agreement Systems and Their Application to Portable Communications,” Proc. Eurocrypt '92, pp. 208220, 1993.
[4] C. Boyd and C. Pavlovski, “Attacking and Repairing Batch Verification Schemes,” Proc. Asiacrypt '00, pp. 5871, 2000.
[5] M. Brown, D. Hankerson, J. López, and A. Menezes, “Software Implementation of the NIST Elliptic Curves over Primes Fields,” Proc. Cryptographer's Track RSA Conf. '01, pp. 250265, 2001.
[6] R. Cramer and V. Shoup, “Signature Schemes Based on the Strong RSA Assumptions,” ACM Trans. Information and System Security, vol. 3, no. 3, pp. 161185, 2000.
[7] Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI X9.62, approved 7 Jan. 1999.
[8] A. Fiat, “Batch RSA,” J. Cryptology, vol. 10, no. 2, pp. 7588, 1997.
[9] L. Guillou and J. Quisquater, “A Practical ZeroKnowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory,” Proc. Eurocrypt '88, pp. 123128, 1988.
[10] D. Hankerson, J. Hernandez, and A. Menezes, “Software Implementation of Elliptic Curve Cryptography over Binary Fields,” Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES '00), pp. 124, 2000.
[11] A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” Proc. Crypto '04, pp.213219, 2004.
[12] D. M'Raithi and D. Naccache, “Batch Exponentiation—A Fast DLP Based Signature Generation Strategy,” Proc. ACM Conf. Computer and Comm. Security, pp. 5861, 1996.
[13] E. Mykletun, M. Narasimha, and G. Tsudik, “Authentication and Integrity in Outsourced Databases,” Proc. ISOC Symp. Network and Distributed Systems Security (NDSS '04), 2004.
[14] V. Muller, “Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two,” J. Cryptology, vol. 11, pp. 219234, 1998.
[15] D. Naccache, D. M'Raithi, S. Vaudenay, and D. Raphaeli, “Can D.S.A. Be Improved? Complexity TradeOffs with the Digital Signature Standard,” Proc. Eurocrypt '94, pp. 7785, 1994.
[16] J. Pastuszak, D. Michalek, J. Pieprzyk, and J. Seberry, “Identification of Bad Signatures in Batches,” Proc. Int'l Conf. Theory and Practice of Public Key Cryptography (PKC '00), pp. 2845, 2000.
[17] J. Solinas, “An Improved Algorithm for Arithmetic on a Family of Elliptic Curves,” Proc. Crypto '97, pp. 357371, 1997, http://www.cacr.math.uwaterloo.catechreports /.
[18] S. Yen and C. Laih, “Improved Digital Signature Suitable for Batch Veriffication,” IEEE Trans. Computers, vol. 44, no. 7, pp. 957959, July 1995.