Reference : Optimality Results on the Security of Lookup-Based Protocols

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/31961

Title :	Optimality Results on the Security of Lookup-Based Protocols
Language :	English
Author, co-author :	Mauw, Sjouke [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Toro Pozo, Jorge Luis [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Trujillo Rasua, Rolando [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	Dec-2016
Main document title :	Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016, Hong Kong, China, November 30 - December 2, 2016, Revised Selected Papers
Editor :	Hancke, Gerard P.
	Markantonakis, Konstantinos
Publisher :	Springer
Pages :	137-150
Peer reviewed :	Yes
On invitation :	No
Audience :	International
ISBN :	978-3-319-62023-7
Event name :	Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016
Event date :	from 30-11-2016 to 02-12-2016
Event organizer :	City University of Hong Kong
Event place (city) :	Hong Kong
Event country :	China
Abstract :	[en] Distance-bounding protocols use the round-trip time of a challenge-response cycle to provide an upper-bound on the distance between prover and verifier. In order to obtain an accurate upper-bound, the computation time at the prover’s side should be as short as possible, which can be achieved by precomputing the responses and storing them in a lookup table. However, such lookup-based distance bounding protocols suffer from a trade-off between the achieved security level and the size of the lookup table. In this paper, we study this security-memory trade-off problem for a large class of lookup-based distance bounding protocols; called layered protocols. Relying on an automata-based security model, we provide mathematical definitions for different design decisions used in previous lookup-based protocols, and perform general security analyses for each of them. We also formalize an interpretation of optimal trade-off and find a non-trivial protocol transformation approach towards optimality. That is to say, our transformation applied to any layered protocol results in either an improved or an equal protocol with respect to the optimality criterion. This transformation allows us to provide a subclass of lookup-based protocol that cannot be improved further, which means that it contains an optimal layered protocol.
Funders :	Fonds National de la Recherche - FnR
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/10993/31961
DOI :	10.1007/978-3-319-62024-4_10
FnR project :	FnR ; FNR10188265 > Jorge Luis Toro Pozo > DBMP > Symbolic Verification Of Distance-Bounding And MultipartyAuthentication Protocols > 01/06/2015 > 31/05/2018 > 2015

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access MTT16_RFIDSec16.pdf Author preprint 319.47 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map