Unidirectional key distribution across time and space with applications to RFID security

Proceedings of the 17th USENIX Security Symposium

Volumn , Issue , 2008, Pages 75-90

  Juels, Ari ^a   Pappu, Ravikanth ^b   Parno, Bryan ^c  

^a RSA   (United States)

^b ThingMagic Inc   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SUPPLY CHAINS;

ACROSS TIME; KEY DISTRIBUTION; KEY MANAGEMENT; KEY SHARING; RFID SECURITY; RFID-ENABLED SUPPLY CHAINS; SECRET KEY DISTRIBUTION; UNIDIRECTIONAL CHANNEL;

RADIO FREQUENCY IDENTIFICATION (RFID);

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

References (33)

1. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS, pages 62–73, 1993.
2. M. Bellare and P. Rogaway. Robust computational secret sharing and a unified account of classical secret-sharing goals. In ACM CCS, 2007.
3. C. H. Bennett, G. Brassard, C. Crepeau, and U. Maurer. Generalized privacy amplification. In ISIT: Proceedings IEEE International Symposium on Information Theory, 1994.
4. G. Blakley. Safeguarding cryptographic keys. In AFIPS Conference Proceedings, volume 48, pages 313–317, 1979.
5. G. Blakley and C. Meadows. Security of ramp schemes. In Advances in Cryptology: Proceedings of CRYPTO, 1984.
6. D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical identity based encryption with constant size ciphertext. In EUROCRYPT, volume 3494 of Lecture Notes in Computer Science, pages 440–456, 2005.
7. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586–615, 2003.
8. D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. Advances in Cryptology: Proceedings of CRYPTO, 2005.
9. E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. Journal of Cryptology, 5:153–166, 1992.
10. R. M. Capocelli, A. D. Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Journal of Cryptology, 6:157–167, 1993.
11. J. Daemen. Hash Function and Cipher Design: Strategies Based on Linear and Differential Cryptanalysis. Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium, Mar. 1995.
12. EPC Global. EPC® Radio-Frequency Protocols Class-1 Generation-2 UHF RFID Protocol for Communications at 860 MHz – 960 MHz Version 1.1.0. EPC Global, 2006.
13. EPC Global. EPC® Item Level Tagging Joint Requirements Group. EPC Global, 2007.
14. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory, 45(6):1757–1767, 1999.
15. A. Juels. Strengthing EPC tags against cloning. In ACM Workshop on Wireless Security (WiSe), pages 67–76. ACM Press, 2005.
16. A. Juels, D. Molnar, and D. Wagner. Security issues in e-passports. In SecureComm, 2005.
17. A. Juels and M. Sudan. A fuzzy vault scheme. Des. Codes Cryptography, 38(2):237–257, 2006.
18. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Transactions on Information Theory, 29(1):35–41, 1983.
19. A. Kiayias and M. Yung. Directions in polynomial reconstruction based cryptography. IEICE Transactions, E87-A(5):978–985, 2004.
20. H. Krawczyk. Secret sharing made short. In Advances in Cryptology: Proceedings of CRYPTO, pages 136–146, New York, NY, USA, 1994. Springer-Verlag New York, Inc.
21. M. Langheinrich and R. Marti. Practical minimalist cryptography for RFID privacy. In submission, 2007.
22. M. Langheinrich and R. Marti. RFID privacy using spatially distributed shared secrets. In Proceedings of UCS 2007, LNCS, Berlin Heidelberg New York, Nov. 2007. Springer. (To appear).
23. J. L. Massey. Shift register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15(1):122–127, 1969.
24. J. M. McCune, A. Perrig, and M. K. Reiter. Seeing-is-Believing: Using camera phones for human-verifiable authentication. In Proceedings of the IEEE Symposium on Security and Privacy, May 2005.
25. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 24(9):583–584, 1981.
26. W. Ogata and K. Kurosawa. Some basic properties of general nonperfect secret sharing schemes. Journal of Universal Computer Science, 4(8), 1998.
27. M. O. Rabin. The information dispersal algorithm and its applications, 1990.
28. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal SIAM, 8:300–304, 1960.
29. P. Rogaway, M. Bellare, and J. Black. OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM TISSEC, Nov. 2001.
30. N. Sastry, U. Shankar, and D. Wagner. Secure verification of location claims. In ACM Workshop on Wireless Security (WiSe 2003), pages 1–10, Sept. 2003.
31. B. Schneier. Description of a new variable-length key, 64-bit block cipher (blowfish). In R. J. Anderson, editor, FSE, volume 809 of Lecture Notes in Computer Science, pages 191–204. Springer, 1993.
32. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.
33. F. Stajano and R. Anderson. The resurrecting duckling: Security issues for ad-hoc wireless networks. In Security Protocols, 7th International Workshop. Springer Verlag, 1999.