
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Saikat Chakrabarti, Santosh Chandrasekhar, Mukesh Singhal, Kenneth L. Calvert, "An Efficient and Scalable QuasiAggregate Signature Scheme Based on LFSR Sequences," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 7, pp. 10591072, July, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.261, author = {Saikat Chakrabarti and Santosh Chandrasekhar and Mukesh Singhal and Kenneth L. Calvert}, title = {An Efficient and Scalable QuasiAggregate Signature Scheme Based on LFSR Sequences}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {7}, issn = {10459219}, year = {2009}, pages = {10591072}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.261}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Efficient and Scalable QuasiAggregate Signature Scheme Based on LFSR Sequences IS  7 SN  10459219 SP1059 EP1072 EPD  10591072 A1  Saikat Chakrabarti, A1  Santosh Chandrasekhar, A1  Mukesh Singhal, A1  Kenneth L. Calvert, PY  2009 KW  Digital signature KW  aggregate signature KW  compressed certificate chain KW  distributed content management KW  secure pathvector protocols KW  LFSR sequences KW  LFSRbased public key cryptosystems. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps,” Proc. EUROCRYPT: Int'l Conf. Theory and Applications of Cryptographic Techniques, E. Biham, ed., pp.416432, 2003.
[2] A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, “Sequential Aggregate Signatures from Trapdoor Permutations,” Proc. EUROCRYPT: Int'l Conf. Theory and Applications of Cryptographic Techniques, C. Cachin and J. Camenisch, eds., pp.7490, 2004.
[3] T. Suzuki, Z. Ramzan, H. Fujimoto, C. Gentry, T. Nakayama, and R. Jain, “A System for EndtoEnd Authentication of Adaptive Multimedia Content,” Proc. Eighth IFIP TC6 TC11 Conf. Comm. and Multimedia Security (CMS '04), pp.237249, 2005.
[4] Y. Rekhter, T. Li, and S. Hares, “A Border Gateway Protocol 4 (BGP4),” RFC 4271 (Draft Standard), http://www.ietf.org/rfcrfc4271.txt, Jan. 2006.
[5] S.T. Kent, C. Lynn, J. Mikkelson, and K. Seo, “Secure Border Gateway Protocol (SBGP)—Real World Performance and Deployment Issues,” Proc. Network and Distributed System Security Symp. (NDSS '00), The Internet Soc., 2000.
[6] M. Zhao, S.W. Smith, and D.M. Nicol, “Aggregated Path Authentication for Efficient BGP Security,” Proc. 12th ACM Conf. Computer and Comm. Security (CCS '05), V. Atluri, C. Meadows, and A. Juels, eds., pp.128138, 2005.
[7] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, no. 6, pp.644654, Nov. 1976.
[8] FIPS, “Digital Signature Standard (DSS)” Nat'l Inst. for Standards and Tech nology, pp.ii + 74, Jan. 2000.
[9] H. Niederreiter, “A PublicKey Cryptosystem Based on Shift Register Sequences,” Proc. EUROCRYPT: Workshop Theory and Application of Cryptographic Techniques, F. Pichler, ed., pp.3539, 1986.
[10] G. Gong and L. Harn, “Publickey Cryptosystems Based on Cubic Finite Field Extensions,” IEEE Trans. Information Theory, vol. 45, no. 7, pp.26012605, 1999.
[11] A.K. Lenstra and E.R. Verheul, “The XTR Public Key System,” Proc. 20th Ann. Int'l Cryptology Conf. (CRYPTO '00), M. Bellare, ed., pp.119, 2000.
[12] S. Chakrabarti, S. Chandrasekhar, M. Singhal, and K.L. Calvert, “Authenticating DSR Using a Novel Multisignature Scheme Based on Cubic LFSR Sequences,” Proc. Fourth European Workshop Security and Privacy in Ad Hoc and Sensor Networks (ESAS '07), F.Stajano, C. Meadows, and S. Capkun, eds., pp.156171, 2007.
[13] S. Chakrabarti, S. Chandrasekhar, K.L. Calvert, and M. Singhal, “Efficient Blind Signatures for Accountability,” Proc. Third Workshop Secure Network Protocols (NPSec '07), Oct. 2007.
[14] M. Bellare and P. Rogaway, “Random Oracles are Practical: A Paradigm for Designing Efficient Protocols,” Proc. First ACM Conf. Computer and Comm. Security (CCS '93), pp.6273, 1993.
[15] D. Boneh, B. Lynn, and H. Shacham, “Short Signatures from The Weil Pairing,” J. Cryptology, vol. 17, no. 4, pp.297319, 2004.
[16] J. Xu, Z. Zhang, and D. Feng, “IdBased Aggregate Signatures from Bilinear Pairings,” Proc. Fourth Int'l Conf. Cryptology and Network Security (CANS '05), Y. Desmedt, H. Wang, Y. Mu, and Y.Li, eds., pp.110119, 2005.
[17] S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters, “Sequential Aggregate Signatures and Multisignatures Without Random Oracles,” Proc. 25th Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '06), S. Vaudenay, ed., pp.465485, 2006.
[18] B. Waters, “Efficient IdentityBased Encryption without Random Oracles,” Proc. 24th Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '05), R. Cramer, ed., pp.114127, 2005.
[19] C. Gentry and Z. Ramzan, “IdentityBased Aggregate Signatures,” Proc. Ninth Int'l Conf. Theory and Practice of PublicKey Cryptography (PKC '06), M. Yung, Y. Dodis, A. Kiayias, and T. Malkin, eds., pp.257273, 2006.
[20] A. Boldyreva, C. Gentry, A. O'Neill, and D.H. Yum, “Ordered Multisignatures and IdentityBased Sequential Aggregate Signatures, with Applications to Secure Routing,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), S.D.C. di Vimercati and P.Syverson, eds., pp.276285, 2007.
[21] K. Itakura, H. Nakamura, and K. Nakazawa, “A PublicKey Cryptosystem Suitable for Digital Multisignatures,” NEC Research and Development, pp.18, Oct. 1983.
[22] L. Harn, “New Digital Signature Scheme Based on Discrete Logarithm,” Electronics Letters, vol. 30, no. 5, pp.396398, Mar. 1994.
[23] S. Micali, K. Ohta, and L. Reyzin, “AccountableSubgroup Multisignatures: Extended Abstract,” Proc. Eighth ACM Conf. Computer and Comm. Security (CCS '01), pp.245254, 2001.
[24] C.P. Schnorr, “Efficient Signature Generation by Smart Cards,” J.Cryptology, vol. 4, no. 3, pp.161174, 1991.
[25] A. Boldyreva, “Threshold Signatures, Multisignatures and Blind Signatures Based on The GapDiffieHellmanGroup Signature Scheme,” Proc. Sixth Int'l Workshop Theory and Practice in Public Key Cryptography (PKC '03), Y. Desmedt, ed., pp.3146, 2003.
[26] S. Chakrabarti, S. Chandrasekhar, M. Singhal, and K.L. Calvert, “Authenticating Feedback in Multicast Applications Using a Novel Multisignature Scheme Based on Cubic LFSR sequences,” Proc. 21st Int'l Conf. Advanced Information Networking and Applications Workshops (AINAW '07), vol. 1, pp.607613, 2007.
[27] G. Gong, L. Harn, and H. Wu, “The GH PublicKey Cryptosystem,” Proc. Eighth Ann. Int'l Workshop Selected Areas in Cryptography (SAC '01), revised papers, S. Vaudenay and A.M. Youssef, eds., pp.284300, 2001.
[28] K.J. Giuliani and G. Gong, “New LFSRbased Cryptosystems and the Trace Discrete Log Problem (TraceDLP),” Proc. ThirdInt'l Conf. Sequences and Their Applications (SETA '04), T. Helleseth, D.V. Sarwate, H.Y. Song, and K. Yang, eds., pp.298312, 2004.
[29] S.W. Golomb, Shift Register Sequences. Holden Day, 1967.
[30] E.R. Berlekamp, “Factoring Polynomials pver Large Finite Fields*,” Proc. Second ACM Symp. Symbolic and Algebraic Manipulation (SYMSAC '71), p. 223, 1971.
[31] A.K. Lenstra and E.R. Verheul, “Key Improvements to XTR,” Proc. Sixth Int'l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT '00), T. Okamoto, ed., pp.220233, 2000.
[32] A.K. Lenstra and E.R. Verheul, “Fast Irreducibility and Subgroup Membership Testing in XTR.” Proc. Fourth Int'l Workshop Practice and Theory in Public Key Cryptography (PKC '01), K. Kim, ed., pp.7386, 2001.
[33] E. Peeters, M. Neve, and M. Ciet, “XTR Implementation on Reconfigurable Hardware,” Proc. Sixth Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES '04), M. Joye and J.J. Quisquater, eds., pp.386399, 2004.
[34] P. Horster, H. Petersen, and M. Michels, “MetaElgamal Signature Schemes.” Proc. Second ACM Conf. Computer and Comm. Security (CCS '94), pp.96107, 1994.
[35] P.S.L.M. Barreto, B. Lynn, and M. Scott, “On the Selection of PairingFriendly Groups.” Proc. 10th Ann. Int'l Workshop Selected Areas in Cryptography (SAC '03), revised papers, M. Matsui and R.J.Zuccherato, eds., pp.1725, 2003.
[36] K.J. Giuliani and G. Gong, “Efficient Key Agreement and Signature Schemes Using Compact Representations in ${GF}(p^{10})$ ,” Proc. Int'l Symp. Information Theory (ISIT '04), June 2004.