Distance-Bounding Grouping-Proof Protocols
Examensarbete för masterexamen
Computer systems and networks (MPCSN), MSc
Radio-frequency identification (RFID) is being increasingly used for different types of applications. These applications need protocols that can provide the service and security needed. Currently, there exist distance-bounding protocols that can be used to set an upper limit on how far away a prover can be of a verifier, and grouping-proof protocols that can create a proof of two or more provers being present at the same time. But there exists no protocol that provides both of these security parameters. The purpose of this thesis is to investigate existing protocols and use the information found to create a new type of protocol, a distance-bounding grouping-proof protocol, that provides the security of both the distance-bounding and groupingproof protocols. This was done by doing a research in the area of both types of protocols, and use the research results to design a stronger grouping-proof protocol, and three different distance-bounding grouping-proof protocols. All protocols were analysed in terms of security and privacy. A simulation framework was developed, in which some of the protocols were implemented. They had their effciency, false rejection, and attack resistance evaluated under different conditions. The main conclusion of this thesis is that it was possible to design a protocol that provides the security of both distance-bounding and grouping-proof protocols. The simulation results show that the security can be greatly increased with low impact on the effciency, and that the current method to tolerate noise is not adequate.
Informations- och kommunikationsteknik , Data- och informationsvetenskap , Information & Communication Technology , Computer and Information Science