A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
A public-key cryptosystem based on shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Meta-ElGamal signature schemes
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
The official PGP user's guide
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Accountable-subgroup multisignatures: extended abstract
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Shift Register Sequences
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Small worlds in security systems: an analysis of the PGP certificate graph
Proceedings of the 2002 workshop on New security paradigms
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
BISS: building secure routing out of an incomplete set of security associations
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
A Survey of Secure Wireless Ad Hoc Routing
IEEE Security and Privacy
SRDP: Securing Route Discovery in DSR
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Efficient Authentication for Reactive Routing Protocols
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Another look at “provable security”. II
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.