Formal Computational Unlinkability Proofs of RFID Protocols

Autor:	Hubert Comon, Adrien Koutsos
Jazyk:	angličtina
Rok vydání:	2017
Předmět:	FOS: Computer and information sciences 021110 strategic defence & security studies Theoretical computer science Computer Science - Cryptography and Security business.industry Computer science Hash function 0211 other engineering and technologies Cryptography 02 engineering and technology Mathematical proof Attacker model Set (abstract data type) Turing machine symbols.namesake 0202 electrical engineering electronic engineering information engineering symbols Computer Science::Networking and Internet Architecture 020201 artificial intelligence & image processing business Cryptography and Security (cs.CR) Axiom Computer Science::Cryptography and Security
Zdroj:	CSF
Popis:	We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the properties of hash functions (Collision-Resistance, PRF); ii) To formalize computational unlinkability in the model; iii) To illustrate the method, providing the first formal proofs of unlinkability of RFID protocols, in the computational model.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7e91c2c10d8017df472ddc5bd464d47 http://arxiv.org/abs/1705.02296 Zobrazit plný text záznamu