A tamper-proof and lightweight authentication scheme

Pervasive and Mobile Computing

Volumn 4, Issue 6, 2008, Pages 807-818

  Hammouri, Ghaith ^a   Öztürk, Erdinç ^a   Sunar, Berk ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Low power authentication; Physical unclonable functions (PUF); RFIDs; Sensor networks security; Tamper proof chips

Indexed keywords

LOW POWER ELECTRONICS; RADIO FREQUENCY IDENTIFICATION (RFID); SENSOR NETWORKS;

AUTHENTICATION SCHEME; CHALLENGE-RESPONSE-AUTHENTICATION; LOW POWER; NETWORKS SECURITY; PHYSICAL UNCLONABLE FUNCTIONS (PUF); PHYSICALLY UNCLONABLE FUNCTIONS; TAMPER PROOF; UNIFORM DISTRIBUTION;

AUTHENTICATION;

EID: 55349112850     PISSN: 15741192     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.pmcj.2008.07.001     Document Type: Article

References (45)

1. Agmon S. The relaxation method for linear inequalities. Canadian J. Math. (1964)
2. Berlekamp E.R. Algebraic Coding Theory (1968), McGraw-Hill, New York
3. Berlekamp E.R., Mceliece R.J., and van Tilborg H.C. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24 3 (1978) 384-386
4. Blum A., Frieze A.M., Kannan R., and Vempala S. A polynomial-time algorithm for learning noisy linear threshold functions. Algorithmica 22 1-2 (1998) 35-52
5. Blum A., and Rivest R.L. Training a 3-node neural network is np-complete. COLT '88: Proceedings of the First Annual Workshop on Computational Learning Theory (1988), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
6. Bolotnyy L., and Robins G. Physically unclonable function-based security and privacy in rfid systems. PERCOM '07: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007), IEEE Computer Society, Washington, DC, USA
7. M. Feldhofer, S. Dominikus, J. Wolkerstorfer, Strong authentication for RFID systems using the AES algorithm, in: CHES, 2004
8. V. Feldman, P. Gopalan, S. Khot, A.K. Ponnuswami, New results for learning noisy parities and halfspaces, in: FOCS '06
9. Gassend B., Clarke D., van Dijk M., and Devadas S. Silicon physical random functions. CCS '02: Proceedings of the 9th ACM Conference on Computer and Communications Security (2002), ACM, New York, NY, USA
10. B. Gassend, D. Clarke, M. van Dijk, S. Devadas, Delay-based circuit authentication and applications, in: Proceedings of the 2003 ACM Symposium on Applied Computing, 2003
11. +, in: EUROCRYPT, 2008, pp. 361-378
12. Gilbert H., Robshaw M., and Sibert H. An active attack against HB+ a provably secure lightweight authentication protocol. IEE Electron. Lett. 41 (2005) 21
13. Goldmann M., Håstad J., and Razborov A.A. Majority gates vs. general weighted threshold gates. Comput. Complex. 2 (1992) 277-300
14. O. Goldreich, S. Goldwasser, S. Halevi, Eliminating decryption errors in the ajtai-dwork cryptosystem, in: CRYPTO '97
15. Hammouri G., and Sunar B. PUF-HB: A tamper-resilient HB based authentication protocol. ACNS (2008) 346-365
16. Hopper N.J., and Blum M. Secure human identification protocols. Lecture Notes in Comput. Sci. 2248 (2001) 52-66
17. A. Juels, S.A. Weis, Authenticating pervasive devices with human protocols, in: CRYPTO, 2005
18. Kaps J.-P., and Sunar B. Energy comparison of AES and SHA-1 for ubiquitous computing. In: Z. X., et al. (Ed). Embedded and Ubiquitous Computing (EUC-06) Workshop Proceedings. Lecture Notes in Computer Science (LNCS) vol. 4097 (2006), Springer
19. Kearns M. Efficient noise-tolerant learning from statistical queries. STOC '93: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (1993), ACM Press, New York, NY, USA
20. Kearns M. Efficient noise-tolerant learning from statistical queries. J. ACM 45 6 (1998) 983-1006
21. Kearns M., and Valiant L. Cryptographic limitations on learning boolean formulae and finite automata. J. ACM 41 1 (1994) 67-95
22. Kharitonov M. Cryptographic lower bounds for learnability of boolean functions on the uniform distribution. COLT '92: Proceedings of the Fifth Annual Workshop on Computational Learning Theory (1992), ACM, New York, NY, USA
23. Klivans A.R., O'Donnell R., and Servedio R.A. Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci. 68 4 (2004) 808-840
24. Klivans A.R., and Sherstov A.A. Cryptographic hardness for learning intersections of halfspaces. FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. FOCS'06 (2006), IEEE Computer Society, Washington, DC, USA
25. Klivans A.R., and Sherstov A.A. Unconditional lower bounds for learning intersections of halfspaces. Mach. Learn. 69 2-3 (2007) 97-114
26. J.W. Lee, L. Daihyun, B. Gassend, G.E.S. amd, M. van Dijk, S. Devadas, A technique to build a secret key in integrated circuits for identification and authentication applications, in: Symposium of VLSI Circuits, 2004
27. S. Lemieux, A. Tang, Clone resistant mutual authentication for low-cost rfid technology, Cryptology ePrint Archive, Report 2007/170, 2007
28. Lim D., Lee J.W., Gassend B., Suh G.E., van Dijk M., and Devadas S. Extracting secret keys from integrated circuits. IEEE Trans. VLSI Syst. 13 10 (2005) 1200-1205
29. Massey J. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15 1 (1969) 122-127
30. C.W. O'Donnell, G.E. Suh, S. Devadas, Puf-based random number generation, No. 481, November 2004
31. E. Ozturk, G. Hammouri, B. Sunar, Physical unclonable function with tristate buffers, in: The IEEE International Symposium on Circuits and Systems 2008, ISCAS 2008
32. E. Ozturk, G. Hammouri, B. Sunar, Towards robust low cost authentication for pervasive devices, in: PERCOM '08: Proceedings of the Sixth IEEE International Conference on Pervasive Computing and Communications
33. Perrig A., Szewczyk R., Tygar J.D., Wen V., and Culler D.E. SPINS: Security protocols for sensor networks. Wireless Netw. 8 (2002) 521-534
34. Perrig A., Tygar J.D., Song D., and Canetti R. Efficient authentication and signing of multicast streams over lossy channels. SP '00: Proceedings of the 2000 IEEE Symposium on Security and Privacy (2000), IEEE Computer Society, Washington, DC, USA
35. Posch R. Protecting devices by active coating. J. Univ. Comput. Sci. 4 7 (1998) 652-668
36. A. Poschmann, G. Leander, K. Schramm, C. Paar, New ligh-weight crypto algorithms for RFID, in: Proceedings of The IEEE International Symposium on Circuits and Systems 2007, ISCAS 2007, 2007
37. Regev O. On lattices, learning with errors, random linear codes, and cryptography. STOC '05: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (2005), ACM, New York, NY, USA
38. Roos C., Terlaky T., and Vial J.-P. Interior Point Methods for Linear Optimization. 2nd ed. (2005), Springer
39. Rueppel R.A. Linear complexity and random sequences. EUROCRYPT '85 (1986), Springer-Verlag New York, Inc.
40. Sarma S.E., Weis S.A., and Engels D.W. RFID systems and security and privacy implications. CHES '02 (2003), Springer-Verlag, London, UK
41. B. Skoric, S. Maubach, T. Kevenaar, P. Tuyls, Information-theoretic analysis of coating PUFs, Cryptology ePrint Archive, Report 2006/101, 2006
42. Tuyls P., and Skoric B. Secret key generation from classical physics: Physical uncloneable functions. In: Mukherjee S., Aarts E., Roovers R., Widdershoven F., and Ouwerkerk M. (Eds). AmIware: Hardware Technology Drivers of Ambient Intelligence. Philips Research Book Series vol. 5 (2006), Springer-Verlag
43. Valiant L.G. A theory of the learnable. Commun. ACM 27 11 (1984) 1134-1142
44. Weis S.A. Security parallels between people and pervasive devices. Pervasive Computing and Communication Security (2005), IEEE Press
45. Weis S.A., Sarma S.E., Rivest R.L., and Engels D.W. Security and privacy aspects of low-cost radio frequency identification systems. Security in Pervasive Computing. Lecture Notes in Computer Science vol. 2802 (2004)