TY - GEN
T1 - Authenticating DSR using a novel multisignature scheme based on cubic LFSR sequences
AU - Chakrabarti, Saikat
AU - Chandrasekhar, Santosh
AU - Singhai, Mukesh
AU - Calvert, Kenneth L.
PY - 2007
Y1 - 2007
N2 - The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been applied to authenticate on demand routing protocols in mobile ad hoc networks. In this paper, we propose an efficient, single round multisignature scheme, CLFSR-M, constructed using cubic (third-order) linear feedback shift register (LFSR) sequences. The scheme, CLFSR-M is derived from a 2-party signature scheme CLFSR-S, formed using a well-known variant of the generalized ElGamal signature scheme. The multisignature has been engineered to produce an efficient technique to authenticate route discovery in the dynamic source routing (DSR) protocol. Our technique supports authentication of cached routes. Delegating special functions to nodes or assuming the existence of a trusted third party to distribute certified public keys is not practical in mobile ad hoc networks. We consider a fully distributed mechanism of public key distribution and present two variations of trust policies, based on PGP, for effective management of individual and aggregate public keys. Finally, we perform a theoretical analysis including correctness and security of CLFSR-M and also present a performance (computation and communication costs, storage overhead) comparison of the proposed scheme with existing ones.
AB - The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been applied to authenticate on demand routing protocols in mobile ad hoc networks. In this paper, we propose an efficient, single round multisignature scheme, CLFSR-M, constructed using cubic (third-order) linear feedback shift register (LFSR) sequences. The scheme, CLFSR-M is derived from a 2-party signature scheme CLFSR-S, formed using a well-known variant of the generalized ElGamal signature scheme. The multisignature has been engineered to produce an efficient technique to authenticate route discovery in the dynamic source routing (DSR) protocol. Our technique supports authentication of cached routes. Delegating special functions to nodes or assuming the existence of a trusted third party to distribute certified public keys is not practical in mobile ad hoc networks. We consider a fully distributed mechanism of public key distribution and present two variations of trust policies, based on PGP, for effective management of individual and aggregate public keys. Finally, we perform a theoretical analysis including correctness and security of CLFSR-M and also present a performance (computation and communication costs, storage overhead) comparison of the proposed scheme with existing ones.
KW - DSR
KW - Generalized El Gamal signatures
KW - LFSR-based PKCs
KW - Multisignatures
KW - PGP
KW - Secure routing
KW - Small-world graphs
UR - http://www.scopus.com/inward/record.url?scp=38149124149&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149124149&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73275-4_12
DO - 10.1007/978-3-540-73275-4_12
M3 - Conference contribution
AN - SCOPUS:38149124149
SN - 9783540732747
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 156
EP - 171
BT - Security and Privacy in Ad-hoc and Sensor Networks - 4th European Workshop, ESAS 2007, Proceedings
T2 - 4th European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2007
Y2 - 2 July 2007 through 3 July 2007
ER -