Foundations of security for hash chains in ad hoc networks

Cluster Computing

Volumn 8, Issue 2-3, 2005, Pages 189-195

  Bradford, Phillip G ^a   Gavrylyako, Olga V ^a  

^a University of Alabama   (United States)

Author keywords

Hash chains; K wise independence; Time space lower bound

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILITY; SECURITY OF DATA;

AD HOC NETWORKS; HASH CHAINS; K-WISE INDEPENDENCE; TIME SPACE LOWER BOUND;

DATA COMMUNICATION SYSTEMS;

EID: 18144391542     PISSN: 13867857     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10586-005-6184-6     Document Type: Article

References (21)

1. N. Alon, L. Babai and Alon Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, Journal of Algorithms 7(4) (1986) 567-583.
2. N. Alon and J.H. Spencer, The Probabilistic Method, 2nd edition (John Wiley & Sons, 2000).
3. M. Bellare and P. Rogaway, Random Oracles are practical, A paradigm for designing efficient protocols, in: Proceedings of the First Annual Conference on Computer and Communications Security, ACM Press (1993) pp. 62-73.
4. B. Chor, J. Freidmann, O. Goldreich, J. Håstad, S. Rudich and R. Smolensky, The bit extraction problem or t -resilient functions, in: Proc. 26th FOCS (1985) pp. 396-407.
5. D. Coppersmith and M. Jakobsson, Almost optimal hash sequence traversal, in: The Proceedings of The Fifth Conference on Financial Cryptography (FC'02), Springer-Verlag, (Feb. 2002).
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd edition (MIT Press, 2001).
7. O. Goldreich, Foundations of Cryptography (Basic Tools) (Cambridge University Press, 2001).
8. M. Jakobsson, Fractal hash sequence representation and traversal, in: The Proceedings of 2002 IEEE International Symposium on Information Theory (2002).
9. L. Lamport, Password authentication with insecure communication. Communications of the ACM 24(11) (1981) 770-772.
10. Y. Mansour, N. Nisan and P. Tiwari, The computational complexity of universal hashing, Theoretical Computer Science 107(1) (1993) 121-133.
11. K. Mehlhorn, On the program size of perfect and universal hash functions, in: Foundations of Computer Science FOCS (1982).
12. A. Perrig, R. Canetti, J.D. Tygar and D. Song, Efficient authentication and signaling of multicast streams over lossy channels, In the Proceedings of IEEE Symposium on Research in Security and Privacy (2000) pp. 56-73.
13. A. Perrig, R. Szewczyk, J.D. Tygar, V. Wen and D.E. Culler, SPINS, Security protocols for sensor networks, Wireless Networks 8 (2002) 521-534.
14. A. Perrig and J.D. Tygar, Secure Broadcast Communication in Wired and Wireless Networks (Kluwer Academic Publishers, 2003).
15. R.L. Rivest, Forwards and backwards encryption, Cryptologia 4(1) (1980) 30-33.
16. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms (Addison Wesley, 1996).
17. C.E. Shannon, Communication theory of secrecy systems, Bell Systems Technical Journal 28 (1949) 656-715.
18. D.R. Stinson, Cryptography, Theory and Practice (CRC Press, 1995).
19. D.R. Stinson, Some observations on the theory of cryptographic hash functions, Manuscript (Sept. 2002).
20. J.C. Taylor, An Introduction to Measure and Probability (Springer-Verlag 1997).
21. M.N. Wegman and J.L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences 22(3) (1981) 265-279.