ShortPK: A short-term public key scheme for broadcast authentication in sensor networks

ACM Transactions on Sensor Networks

Volumn 6, Issue 1, 2009, Pages

  Wang, Ronghua ^a   Du, Wenliang ^a   Liu, Xiaogang ^a   Ning, Peng ^b  

^a Syracuse University   (United States)

^b North Carolina State University   (United States)

Author keywords

Communication; Public key; Sensor networks

Indexed keywords

BASIC IDEA; BROADCAST AUTHENTICATION; ENERGY CONSTRAINT; ENERGY CONSUMPTION; KEY DISTRIBUTION SCHEMES; PUBLIC KEY; PUBLIC KEY SCHEMES; PUBLIC KEYS; REAL TIME REQUIREMENT; RECENT TRENDS; SHORT PERIODS; SYMMETRIC KEYS;

AUTHENTICATION; COST REDUCTION; PUBLIC KEY CRYPTOGRAPHY; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 75149140941     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1653760.1653769     Document Type: Article

References (41)

1. ATKIN, A. O. L. ANDMORAIN, F. 1993. Elliptic curves and primality proving. Math. Comput. 29-67.
2. BLOMER, J. ANDMAY, A. 2001. Low secret exponent RSA revisited. In Proceedings of the Workshop on Computational Approaches to Linguistic Creativity (CALC'01) 2146, 4-19.
3. BONEH,D. ANDDURFEE,G. 1999. Cryptanalysis of RSA with private key d less than N0.292. Lecture Notes in Computer Science, vol.1592, 1-9.
4. CANETTI, R., GARAY, J., ITKIS, G., MICCIANCIO, D., NAOR, M., AND PINKAS, B. 1999. Multicast security: A taxonomy and some efficient constructions. In Proceedings of the 18th IEEE Conference on Computer Communications (Infocom'99). CERTICOM, R. Certicom ecc challenge. ECC challenge website, http://www.certicom.com/index.php?action=res,ecc challenge.
5. CERTICOM, R. 2000. Standards for efficient cryptography-SEC2: Recommended elliptic curve domain parameters.Website of SEC group. http://www.secg.org/ download/aid-386/sec2 final.pdf.
6. DAI, H. AND HAN, R. 2004. Tsync: A lightweight bidirectional time synchronization service for wireless sensor networks. ACM SIGMOBILE Mobile Comput. Comm. Rev. 8, 1, 125-139.
7. DU, W., AND NING, R. W. P. 2005. An efficient scheme for authenticating public keys in sensor networks. In Proceedings of the 6th ACMInternational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
8. EBERLE, H., GURA, N., CHANG, S., GUPTA, V., RARICK, L., AND SUNDARAM, S. 2004. A public-key cryptographic processor for RSA and ECC. In Proceedings of the 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP).
9. GENNARO, R. AND ROHATGI, P. 1997. How to sign digital streams. Tech. rep. IBM T.J.Watson Research Center.
10. GOLLE, P. AND MODADUGU, N. 2001. Authenticating streamed data in the presence of random packet loss. In Proceedings of the Network and Distributed System Security Symposium (NDSS'01).
11. GURA, N., PATEL, A., WANDER, A., EBERLE, H., AND SHANTZ, S. C. 2004. Comparing elliptic curve cryptography andRSAon 8-bit CPUs. In Proceedings of theWorkshop on Cryptographic Hardware and Embedded Systems (CHES'04).
12. HALL, C.,WAGNER, D., KELSEY, J., AND SCHNEIER, B. 1998. Building PRFs from PRPs. Lecture Notes in Computer Science, vol.1462, 370-389.
13. HAVINGA, P. 1999. Energy efficiency of error correction on wireless systems. In Proceedings of the IEEE Wireless Communications and Networking Conference.
14. INTANAGONWIWAT, C., GOVINDAN, R., AND ESTRIN, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom).
15. KONSTANTINOU, E., STAMATIOU, Y., AND ZAROLIAGIS, C. 2002. On the efficient generation of elliptic curves over prime fields. Lecture Notes in Computer Science, vol.2523, 333-348.
16. LUBY, M. AND RACKOFF, C. 1988. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17, 2, 373-386.
17. MENEZES, A., OKAMOTO, T., AND VANSTONE, A. 1993. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory 39, 5, 1639-1646.
18. MERKLE, R. 1980. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy.
19. MINER, S. AND STADDON, J. 2001. Graph-Based authentication of digital streams. In Proceedings of IEEE Symposium on Security and Privacy (IEEE S&P'01). 232-246.
20. NAOR, M. AND REINGOLD, O. 1999. On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptol. J. Int. Assoc. Cryptol. Res. 12, 1, 29-66.
21. NING, P. 2006. Tinyecc: Elliptic curve cryptography for sensor networks. Cyber Defense Lab, North Carolina State University. http://discovery.csc.ncsu. edu/pning/software/TinyECC/index.html.
22. OSTROVSKY, R. AND PATT-SHAMIR, B. 1999. Optimal and efficient clock synchronization under drifting clocks. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC).
23. PERRIG, A. 2001. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the ACM Conference on Computer and Communications Security (CCS'01). 28-37.
24. PERRIG, A., CANETTI, R., SONG, D., AND TYGAR, D. 2001a. Efficient and secure source authentication for multicast. In Proceedings of Network and Distributed System Security Symposium (NDSS'01).
25. PERRIG, A., SZEWCZYK, R.,WEN, V., CULLAR, D., AND TYGAR, J. D. 2001b. Spins: Security protocols for sensor networks. In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom'01). 189-199.
26. POLLARD, J. M. 1978. Monte Carlo methods for index computation (mod p). Math. Comput. 32, 143, 918-924.
27. PUHRINGER, C. 2005. High speed elliptic curve cryptography processor for g f (p). http://jce.iaik.tugraz.at/sic/content/download/713/5324/file/2005-ECC- Puehringer.pdf.
28. ROHATGI, P. 1999. A compact and fast hybrid signature scheme for multicast packet. In Proceedings of the 6th Conference on Computer and Communications Security (CCS'99). 93-100.
29. SHANK, D. 1971. Class number, a theory of factorization, and genera. In Proceedings of the Symposium on Pure Mathematics XX. 415-440.
30. SICHITIU, M. AND VEERARITTIPHAN, C. 2003. Simple, accurate time synchronization for wireless sensor networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC).
31. SONG,D., ZUCKERMAN,D., AND TYGAR, J.D. 2002. Expander graphs for digital stream authentication and robust overlay networks. In Proceedings of IEEE Symposium of Security and Privacy (IEEE S&P'02).
32. VANSTONE, S. 2003. Next generation security for wireless: Elliptic curve cryptography. Comput. Secur. 22, 5, 412-459.
33. WANDER, A., GURA, N., EBERLE, H., GUPTA, V., AND SHANTZ, S. 2005. Energy analysis of public-key cryptography for wireless sensor network. In Proceedings of the 3rd Annual IEEE International Conference on Pervasive Computing and Communication (Percom'05).
34. WANG, X. AND YU,H. 2005. How to break md5 and other hash functions. In Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'05).
35. WANG, X., YU, H., AND YIN, Y. 2005a. Efficient collision search attacks on sha-0. In Proceedings of the 25th Annual International Cryptology Conference (CRYPTO'05).
36. WANG, X., YU, H., AND YIN, Y. 2005b. Finding collisions in the full sha-1. In Proceedings of the 25th Annual International Cryptology Conference (CRYPTO'05).
37. WASHINGTON, L. 2003. Elliptic Curves: Number Theory and Cryptography. Chapman and Hall/CRC.
38. WIENER, M. 1990. Cryptanalysis of short RSA secret exponents. IEEE Trans. Inform. Theory 36, 553-558.
39. WOLKERSTORFER, J. 2004. Hardware aspects of elliptic curve cryptography. Ph.D. thesis, Graz University of Technology.
40. WONG, C. AND LAM, S. 1998. Digital signatures for flows and multicasts. In Proceedings of the 6th IEEE International Conference on Network Protocols (ICNP'98).
41. YU, Y. AND PRANSANNA, V. 2005. Energy-Balanced task allocation for collaborative processing In wireless sensor networks. Mobile Netw. Appl. 10, 115-131.