Dialog codes for secure wireless communications

2009 International Conference on Information Processing in Sensor Networks, IPSN 2009

Volumn , Issue , 2009, Pages 13-24

  Arora, Anish ^a   Sang, Lifeng ^a  

^a Ohio State University   (United States)

Author keywords

Dialog codes; Security; Wireless sensor network

Indexed keywords

CHANNEL MODEL; DECODING PROCESS; DIALOG CODES; EXPERIMENTAL VALIDATIONS; IEEE 802.15.4; O(1) COMPLEXITY; OPTIMAL CODING; PERFECT SECRECY; RECEIVER MODELS; RESOURCE-CONSTRAINED; SECURE CODES; SECURE CODING; SECURE WIRELESS COMMUNICATION; SECURITY; SECURITY BOOTSTRAPPING; SHARED SECRETS; TIME VARYING CHANNEL; WIRELESS NETWORK COMMUNICATION;

DATA PROCESSING; IMAGE CODING; NETWORK SECURITY; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70549101452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. http://en.wikipedia.org/wiki/key size.
2. http://www.tinyos.net.
3. A. Arora and L. Sang. Dialog codes for secure wireless communications. Technical Report, Ohio State University, OSU-CISRC-5/08-TR23, 2008.
4. G. Blakley. Safeguarding cryptographic keys. Proc. AFIPS 1979 NCC, 48:pp. 313-317, June 1979.
5. C. Castelluccia and P. Mutaf. Shake them up!: a movement-based pairing protocol for cpu-constrained devices. Mobisys, 2005.
6. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. FOCS85, pages pp. 383-395, 1985.
7. I. Csiszar and J. Korner. Broadcast channels with confidential messages. IEEE Trans. Information Theory, 24(3):339-348, May 1978.
8. P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transaction on information theory, 46(2), Mar 2000.
9. T. H.Cormen, C. E.Leiserson, R. L.Rivest, and C. Stein. Introduction to algorithms. The MIT Press, 2001.
10. X. He and A. Yener. The role of an untrusted relay in secret communication. in Proceedings of the IEEE International Symposium on Information Theory (ISIT'08), 2008.
11. L. Lai, H. E. Gamal, and H. V. Poor. The wiretap channel with feedback: Encryption over the channel. IEEE Transactions on Information Theory, 54(11):5059-5067, Nov 2008.
12. S. K. Leung-Yan-Cheong and M. E. Hellman. The gaussian wire-tap channel. IEEE Trans. Information Theory, 24(4):451-456, July 1978.
13. M. Luby. Lt codes. Foundations of Computer Science, 2002., pages 271-280, 2002.
14. MoteIV. http://www.moteiv.com/.
15. L. H. Ozarow and A. D. Wyner. The wire-tap channel ii. Bell Syst. Tech. Journal, 63:2135-2157, 1984.
16. L. Sang and A. Arora. Capabilities of low-power wireless jammers. Infocom Miniconference, 2009.
17. A. Sayeed and A. Perrig. Secure wireless communications: Secret keys through multipath. ICASSP, 2008.
18. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
19. A. Shokrollahi. Raptor codes. IEEE Transactions on Information Theory, 52(6):2551-2567, 2006.
20. E. Tekin and A. Yener. The general gaussian multiple access and two-way wire-tap channels: Achievable rates and cooperative jamming. IEEE Transactions on Information Theory - Special Issue on Information Theoretic Security, 54(6):2735-2751, 2008.
21. A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla. Applications of ldpc codes to the wiretap channel. IEEE Transactions on Information Theory, 53(8):2933-2945, 2007.
22. V. K. Wei. Generalized hamming weights for linear codes. IEEE Transactions on Information Theory, 37(5):1412-1418, 1991.
23. A. D. Wyner. The wire-tap channel. in Bell Syst. Tech. J., 54(8), pages 1355-1387, 1975.