Description
RFID tags are tiny computational devices with no internal source of power, which are likely to be deployed in a large number of applications in the next few years. In this talk I will describe several light weight security algorithms which were designed specifically for such devices, and in particular a new hash function called SQUASH which is provably at least as one-way as the Rabin scheme. It can be implemented with a very small number of gates on RFID tags, and it is extremely fast on larger processors with arbitrary word sizes.
Next sessions
-
Oblivious Transfer from Zero-Knowledge Proofs (or how to achieve round-optimal quantum Oblivious Transfer without structure)
Speaker : Léo Colisson - Université Grenoble Alpes
We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable oblivious transfer (OT) protocol (the protocol itself involving quantum interactions), mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions…) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely[…]-
Cryptography
-