Cryptography in radio frequency identification and fair exchange protocols

摘要: This PhD thesis focuses on fair exchange protocols and radio frequency identification protocols. Fair stems from a daily life problem: how can two people objects (material or immaterial) fairly, that is, without anyone being hurt in the exchange? More formally, if Alice Bob each have mA mB respectively, then is if, at end of protocol, both received neither nor expected information, even partially. Ensuring fairness an impossible introducing additional assumptions. Thus, we propose approaches to overcome this problem. The first consists attaching person, guardian angel, security module conceived by trustworthy authority whose behavior cannot deviate established rules. In such model, be ensured with probability as close 1 desired, implying however communication complexity cost. We use results distributed algorithm generalize approach for n people. Finally, second no more considering isolated manner, but replace it its context, heart network, where person pair has few honest neighbors. framework, lie these neighbors, who are solicited only case conflict during exchange. look into Radio Frequency Identification (RFID), which remotely identifying subjects having transponder. great achievements made today, lies essentially willingness develop low cost small size transponders. Consequently, they limited computation storage capabilities. Due reason, many questions been asked regarding RFID's potential limitations, precisely terms privacy. Since recent problem, works presented document outline completely framework certain basic concepts. particular, present classify threats, show link between traceability analyze existing RFID also issues due key management. solution proposed Molnar Wagner weaknesses another based time-memory trade-offs. continue our trade-off analysis proposing method checkpoints, allows detecting false alarms probabilistic manner.