How secret-sharing can defeat terrorist fraud

WiSec'11 - Proceedings of the 4th ACM Conference on Wireless Network Security

Volumn , Issue , 2011, Pages 145-155

  Avoine, Gildas ^a   Lauradoux, Cédric ^b   Martin, Benjamin ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIV LYON   (France)

Author keywords

Authentication; Distance bounding; Mafia fraud; Secret sharing; Terrorist fraud; Threshold cryptography

Indexed keywords

AUTHENTICATION; NETWORK SECURITY; TERRORISM;

DISTANCE BOUNDING; MAFIA FRAUD; SECRET SHARING; TERRORIST FRAUDS; THRESHOLD CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 80051887821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998412.1998437     Document Type: Conference Paper

References (38)

1. G. Avoine, M. A. Bingöl, S. Kardaş, C. Lauradoux, and B. Martin. A Framework for Analyzing RFID Distance Bounding Protocols. Journal of Computer Security - Special Issue on RFID System Security, 2010.
2. G. Avoine, E. Dysli, and P. Oechslin. Reducing Time Complexity in RFID Systems. In Selected Areas in Cryptography - SAC 2005, volume 3897 of Lecture Notes in Computer Science, pages 291-306, Kingston, Canada, August 2005. Springer-Verlag.
3. G. Avoine, C. Floerkemeier, and B. Martin. RFID Distance Bounding Multistate Enhancement. In International Conference on Cryptology in India-Indocrypt 2009, volume 5922 of Lecture Notes in Computer Science, pages 290-307. Springer-Verlag, 2009.
4. S. Bengio, G. Brassard, Y. Desmedt, C. Goutier, and J.-J. Quisquater. Secure implementation of identification systems. Journal of Cryptology, 4(3):175-183, 1991.
5. T. Beth and Y. Desmedt. Identification Tokens - or: Solving the Chess Grandmaster Problem. In Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 169-177, Santa Barbara, CA, USA, August 1990. Springer-Verlag.
6. G. R. Blakley. Safeguarding cryptographic keys. In AFIPS 1979 National Computer Conference, volume 48, pages 313-317, Arlington, NY, USA, 1979-317.
7. M. Blaze. Looking on the Bright Side of Black-Box Cryptography (Transcript of Discussion). In Security Protocols Workshop, volume 2133 of Lecture Notes in Computer Science, pages 54-61, Cambridge, UK, April 2000. Springer-Verlag. (Pubitemid 33347507)
8. S. Brands and D. Chaum. Distance-Bounding Protocols. In Advances in Cryptology-EUROCRYPT'93, volume 765 of Lecture Notes in Computer Science, pages 344-359, Lofthus, Norway, May 1993. Springer-Verlag.
9. E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. Journal of Cryptology, 4:123-134, 1991.
10. L. Bussard. Trust Establishement Protocols for Communications Devices. PhD thesis, Eurecom-ENST, 2004.
11. L. Bussard and W. Bagga. Distance-bounding proof of knowledge to avoid real-time attacks. In Security and Privacy in the Age of Ubiquitous Computing, volume 181 of IFIP International Federation for Information Processing, pages 223-238. Springer-Verlag, 2005.
12. L. Csirmaz. The Size of a Share Must Be Large. In Advances in Cryptology - EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 13-22, Perugia, Italy, 1994. Springer-Verlag.
13. Y. Desmedt, C. Goutier, and S. Bengio. Special Uses and Abuses of the Fiat-Shamir Passport Protocol. In Advances in Cryptology - CRYPTO'87, volume 293 of Lecture Notes in Computer Science, pages 21-39, Santa Barbara, CA, USA, August 1988. Springer-Verlag.
14. S. Drimer and S. J. Murdoch. Keep your enemies close: distance bounding against smartcard relay attacks. In 16th USENIX Security Symposium on USENIX Security Symposium, pages 1-16, Santa Clara, CA, USA, June 2007. USENIX Association.
15. M. Flury, M. Poturalski, P. Papadimitratos, J.-P. Hubaux, and J.-Y. L. Boudec. Effectiveness of distance-decreasing attacks against impulse radio ranging. In ACM Conference on Wireless Network Security - WISEC 2010, pages 117-128, Hoboken, NJ, USA, 2010. ACM.
16. G. P. Hancke. Design of a Secure Distance-Bounding Channel for RFID. Journal of Network and Computer Applications, May 2010.
17. G. P. Hancke and M. Kuhn. An RFID Distance Bounding Protocol. In Conference on Security and Privacy for Emerging Areas in Communication Networks - SecureComm 2005, pages 67-73, Athens, Greece, September 2005. IEEE Computer Society.
18. G. P. Hancke and M. G. Kuhn. Attacks on time-of-flight distance bounding channels. In ACM Conference on Wireless Network Security - WISEC 2008, pages 194-202, Alexandria, VA, USA, March 2008. ACM.
19. International Organization for Standardization. ISO/IEC 9798 - Information technology - Security techniques - Entity authentication, 1997 - 2008.
20. A. Joux. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 306-316, Santa Barbara, CA, USA, August 2004. Springer-Verlag.
21. C. H. Kim and G. Avoine. RFID distance bounding protocol with mixed challenges to prevent relay attacks. In International Conference on Cryptology and Network Security - CANS, volume 5888 of Lecture Notes in Computer Science, pages 119-133, Kanazawa, Ishikawa, Japan, December 2009. Springer-Verlag.
22. C. H. Kim, G. Avoine, F. Koeune, F.-X. Standaert, and O. Pereira. The Swiss-Knife RFID Distance Bounding Protocol. In International Conference on Information Security and Cryptology - ICISC'08, volume 5461 of Lecture Notes in Computer Science, pages 98-115, Seoul, Korea, December 2008. Springer-Verlag.
23. M. Kuhn, H. Luecken, and N. O. Tippenhauer. UWB Impulse Radio Based Distance Bounding. In Workshop on Positioning, Navigation and Communication 2010 - WPNC'10, Dresden, Germany, March 2010.
24. J. L. Massey. Minimal Codewords and Secret Sharing. In Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pages 276-279, 1993.
25. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Communication of the ACM, 24(9):583-584, 1981.
26. A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, and J. C. Hernandez-Castro. Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels. IEEE Communications Letters, 14(2):121-123, July 2010.
27. J. Munilla and A. Peinado. Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels. Wireless Communications and Mobile Computing, 8(9):1227-1232, 2008.
28. C. Paar. Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields. PhD thesis, Universität GH Essen, 1994.
29. K. B. Rasmussen and S. Čapkun. Realization of RF Distance Bounding. In USENIX Security Symposium, Washington, DC, USA, August 2010.
30. J. Reid, J. M. G. Nieto, T. Tang, and B. Senadji. Detecting relay attacks with timing-based protocols. In ACM symposium on Information, computer and communications security - ASIACCS '07, pages 204-213. ACM, 2007. Early version available at citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.5584. (Pubitemid 47479240)
31. A. Saxena, B. Wyseur, and B. Preneel. Towards Security Notions for White-Box Cryptography. In Information Security Conference-ISC 2009, volume 5735 of Lecture Notes in Computer Science, pages 49-58, Pisa, Italy, September 2009. Springer-Verlag.
32. A. Shamir. How to share a secret. Communication of the ACM, 22(11):612-613, 1979.
33. G. J. Simmons. Contemporary Cryptology: The Science of Information Integrity. IEEE Press, 1991.
34. D. Singelée and B. Preneel. Distance Bounding in Noisy Environments. In European Workshop on Security in Ad-hoc and Sensor Networks - ESAS'07, volume 4572 of Lecture Notes in Computer Science, pages 101-115, Cambridge, UK, July 2007. Springer-Verlag.
35. K. Suzuki, D. Tonien, K. Kurosawa, and K. Toyota. Birthday Paradox for Multi-collisions. In Information Security and Cryptology - ICISC 2006, volume 4296 of Lecture Notes in Computer Science, pages 29-40, Busan, Korea, November 2006. Springer-Verlag. (Pubitemid 47163808)
36. R. Trujillo Rasua, B. Martin, and G. Avoine. The Poulidor Distance-Bounding Protocol. In S. O. Yalcin, editor, Workshop on RFID Security - RFIDSec'10, volume 6370 of Lecture Notes in Computer Science, pages 239-257, Istanbul, Turkey, June 2010. Springer-Verlag.
37. Y.-J. Tu and S. Piramuthu. RFID Distance Bounding Protocols. In First International EURASIP Workshop on RFID Technology, Vienna, Austria, September 2007.
38. D. Wagner. A Generalized Birthday Problem. In Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 288-303, Santa Barbara, CA, USA, August 2002. Springer-Verlag.