Overview of the latest RFID Research 21 st March 20071 Overview of the latest RFID Research at Auto-ID Lab, ADELAIDE Alfio Grasso Deputy Director, Auto-ID.

Slides:



Advertisements
Similar presentations
1 Auto-ID Lab ADELAIDE (RFID Automation) Alfio Grasso Deputy Director Auto-ID Lab Adelaide General Manager RFID Automation.
Advertisements

CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
Physical Unclonable Functions and Applications
Sri Lanka Institute of Information Technology
Computer Science CSC 474By Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.1 Introduction to Cryptography.
CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
1 Supplement III: Security Controls What security services should network systems provide? Confidentiality Access Control Integrity Non-repudiation Authentication.
A Simple and Cost-effective RFID Tag-Reader Mutual Authentication Scheme Divyan M. Konidala, Zeen Kim, Kwangjo Kim {divyan, zeenkim, International.
Mar 12, 2002Mårten Trolin1 This lecture Diffie-Hellman key agreement Authentication Certificates Certificate Authorities SSL/TLS.
1 Cryptography and Network Security Third Edition by William Stallings Lecturer: Dr. Saleem Al_Zoubi.
Security Overview Hofstra University University College for Continuing Education - Advanced Java Programming Lecturer: Engin Yalt May 24, 2006.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Lesson Title: Introduction to Cryptography Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
Mar 4, 2003Mårten Trolin1 This lecture Diffie-Hellman key agreement Authentication Certificates Certificate Authorities.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
CS1001 Lecture 24. Overview Encryption Encryption Artificial Intelligence Artificial Intelligence Homework 4 Homework 4.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.
Computer Security CS 426 Lecture 3
Lecture 4 Cryptographic Tools (cont) modified from slides of Lawrie Brown.
Dual-frequency Antenna Design for RFID Application
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Encryption is a way to transform a message so that only the sender and recipient can read, see or understand it. The mechanism is based on the use of.
Introduction to Public Key Cryptography
RFID and Wine Alfio Grasso Deputy Director Auto-ID Lab, ADELAIDE.
Computer Security Tran, Van Hoai Department of Systems & Networking Faculty of Computer Science & Engineering HCMC University of Technology.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)
RFID Tags for Critical JSF Components/Sub-Assemblies Alfio Grasso Deputy Director Auto-ID Lab, ADELAIDE.
Key Management and Diffie- Hellman Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 12/3/2009 INCS 741: Cryptography 12/3/20091Dr. Monther.
Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.
Cryptography, Authentication and Digital Signatures
A SMALL PASSIVE UHF RFID TAG FOR METALLIC ITEM IDENTIFICATION Mun Leng Ng Auto-ID Adelaide School of Electrical & Electronic Engineering University.
1 UCR Hardware Security Primitives with focus on PUFs Slide credit: Srini Devedas and others.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Cryptography and Network Security (CS435) Part Eight (Key Management)
Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.
11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.
Shanti Bramhacharya and Nick McCarty. This paper deals with the vulnerability of RFIDs A Radio Frequency Identifier or RFID is a small device used to.
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
Cryptography and Network Security Key Management and Other Public Key Cryptosystems.
RFID and Sensor Networks for Rural Environments Alfio Grasso Deputy Director Auto-ID Lab, ADELAIDE.
無線網路安全 WEP. Requirements of Network Security Information Security Confidentiality Integrity Availability Non-repudiation Attack defense Passive Attack.
Lecture 2: Introduction to Cryptography
NEW DIRECTIONS IN CRYPTOGRAPHY Made Harta Dwijaksara, Yi Jae Park.
1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,
Focus On Bluetooth Security Presented by Kanij Fatema Sharme.
Security fundamentals Topic 4 Encryption. Agenda Using encryption Cryptography Symmetric encryption Hash functions Public key encryption Applying cryptography.
Key Management Network Systems Security Mort Anvari.
Network Security Celia Li Computer Science and Engineering York University.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Fall 2006CS 395: Computer Security1 Key Management.
Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:
INCS 741: Cryptography Overview and Basic Concepts.
Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim
Key Management public-key encryption helps address key distribution problems have two aspects of this: – distribution of public keys – use of public-key.
1 CPCS425: Information Security (Topic 5) Topic 5  Symmetrical Cryptography  Understand the principles of modern symmetric (conventional) cryptography.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
หัวข้อบรรยาย Stream cipher RC4 WEP (in)security LFSR CSS (in)security.
Security through Encryption
Key Management Network Systems Security
Presentation transcript:

Overview of the latest RFID Research 21 st March Overview of the latest RFID Research at Auto-ID Lab, ADELAIDE Alfio Grasso Deputy Director, Auto-ID Lab, Adelaide

Overview of the latest RFID Research 21 st March Overview Auto-ID Lab, Adelaide Security Anti-Counterfeiting and Security Authentication Lightweight Cryptography Specialised RFID Tag Antenna Design Conclusions

Overview of the latest RFID Research 21 st March Adelaide, Auto-ID Lab

Overview of the latest RFID Research 21 st March The Auto-ID Laboratories

Overview of the latest RFID Research 21 st March Auto-ID Labs One of 7 Auto-ID Labs around the world MIT, USA Cambridge, UK Adelaide, Australia Keio, Japan Fudan, China St Gallen, Switzerland ICU, Korea

Overview of the latest RFID Research 21 st March Three entities Auto-ID Lab EPCglobal research  via sub-award from MIT RFID Automation Contract Research  Eight Consultancies  One Research Contract  One Research Project Australasian Adoption Research Initiative RFID adoption, Networking, Resources

Overview of the latest RFID Research 21 st March Contract Research Separate from the EPCglobal funded work Commercial Infrastructure Adelaide Research & Innovation Pty Ltd Intellectual Property Protection Pork CRC Research Contract Joint Strike Fighter

Overview of the latest RFID Research 21 st March Auto-ID Lab, Personnel Prof. Peter Cole Mr. Alfio Grasso Dr. Behnam Jamali Mr. Damith Ranasinghe Mr. Kin Seong Leong Ms. Mun Leng Ng Mr. Raja Ghosal Mr. Manfred Jantscher (visiting)

Overview of the latest RFID Research 21 st March Anti-counterfeiting and Security Authentication Lightweight Cryptography

Overview of the latest RFID Research 21 st March Auto-ID Labs In 2006 Global Auto-ID Labs launched the Flagship Project Anti-Counterfeiting and Secure Supply-Chain Focuses on protection against counterfeiting and on product traceability. The main emphasis is on EPC technology without neglecting other methods. In addition to the technology, topics include the impacts on processes within an enterprise, the assessment of customer acceptance and the analysis of business cases in order to examine operational efficiency.

Overview of the latest RFID Research 21 st March RFID Channels Insecure communication channel Authorised Interrogator Powering channel Forward channel (Reader to Tag commands) Backward channel (Tag to Reader responses) Legitimate Tag Physical channel

Overview of the latest RFID Research 21 st March Security and Privacy Concepts Security aims Confidentiality Integrity Authentication Non-reputation Availability Privacy aims Anonymity Unlinkability

Overview of the latest RFID Research 21 st March Security Models Unconditional security Perfect security, assumes unrestricted computational power of an adversary Computational security No known algorithm to break it within polynomial time Practical security No breaking algorithm within N operations, with N chosen to be high. Modern primitives offer practical security. Provable security Possible to show the complexity of breaking a primitive is equivalent to solving a well know supposedly hard mathematical problem

Overview of the latest RFID Research 21 st March Security Services Confidentiality Only authorised parties receive information Authentication The ability of a party to be sure the message is from a claimed source Integrity Assures us a message is not altered on the way Non-reputation Proof of transmission and reception Access Control Restricts and controls access to a system Availability Provides means to assure a system is available when needed

Overview of the latest RFID Research 21 st March Attacks Ciphertext-only attack Known-plaintext attack Chosen-plaintext attack Adaptive chosen-plaintext attack Chosen-ciphertext attack Adaptive chosen-ciphertext attack Known-key attack Man-in-the-middle attack Replay attack Impersonation attack Dictionary attack Incomplete session attack

Overview of the latest RFID Research 21 st March Some Security Issues Eavesdropping Corporate espionage. Victim of theft Cloning and Physical attacks Fraud: counterfeiting RFID-labeled items. Theft: replace merchandise with decoy label. Denial of service. Corrupt data with fake tags. Disrupt RFID-dependent infrastructures. Communication layer weaknesses Insecurities from tag generated random numbers Power analysis of the powering channel

Overview of the latest RFID Research 21 st March Some Privacy Issues Profiling Identify a person’s interest by the RFID items they carry Tracking Any RFID item can potentially identify the person If a payment is made via a credit card, any tags on that person can be used to identify that person, and track them Once the identity is known they can be tracked. RFID enabled currency can be used to determine cash on a target.

Overview of the latest RFID Research 21 st March RFID Security Framework Low cost labels gates available for security (cost limitation). Time available for operations : ms. Label reading speeds: labels/s. Data transmission rates: in the order of 100kbps. Labels reveal their presence through a non-identifying signal. The long term security of label contents can not be guaranteed. Power utilization of security related silicon should not exceed the tag power consumption range of microwatts.

Overview of the latest RFID Research 21 st March Initial Proposals Kill tags at checkout. Customers may want to build applications. Erase unique identifiers at checkout. Still allows tracking by tag “constellations”. Restrict and detect unauthorized reads. Cheap to build, hard to always detect. Some scope is found with security schemes designed with reader distance based trust Use strong cryptography to protect tags. Too expensive for low-cost (5-cent) tags.

Overview of the latest RFID Research 21 st March Cryptography

Overview of the latest RFID Research 21 st March Kerchoff’s principle Do not rely on keeping an algorithm secret. Even if you think no one will think of it, someone almost certainly will. Publish an algorithm but keep the key secret. That key should be chosen from amongst a large number of possible keys, that could be used. Have some mathematical foundation for the belief that it will be hard to extract the key from what can be overheard.

Overview of the latest RFID Research 21 st March Shannon insights Add confusion and diffusion Confusion: encoding the information, e.g.  Swapped (A -> X), shifted (A +3 =D), or A c (mod p), Diffusion: spreading the information, adding redundant information, or noise

Overview of the latest RFID Research 21 st March Public Key Cryptography Public key ciphers Examples RSA Diffie-Hellman ECC Digital signatures These form the second group of keyed cryptographic tools. Based on key pairs instead a single shared key. Only one key need be kept secret. Sometimes called asymmetric key systems. The receiving party issues the public encrypting key and keeps to itself the decrypting key.

Overview of the latest RFID Research 21 st March Public Key Encryption The key pair used in the example is the secret key SBob of Bob and the public key PBob of Bob.

Overview of the latest RFID Research 21 st March Precautions needed In practice P is prime of 300 digits and a and b are at least 100 digits long Is vulnerable to man in the middle attack Cure is to digitally sign what is sent if a public key infrastructure is available, or use a pre-shared password.

Overview of the latest RFID Research 21 st March Elliptic Curve Cryptography Uses the discrete log problem but over a finite abelian group of points x, y on an elliptic curve y 2 = x 3 + a*x + b mod (p) ECC keys can be shorter for the same security when compared with other systems No mathematical proof of the difficulty has been published but the scheme is accepted as a standard by USA National Security Agency. Keys must be large enough. A 109 bit key has been broken (roughly same security to RSA 640) 160 bits ECC - same security as RSA 1024 bits. 224 bits ECC - same security as RSA 2048 bits.

Overview of the latest RFID Research 21 st March One Time Codes

Overview of the latest RFID Research 21 st March Need for something simpler RFID tags cannot support the computing burdens of the usual systems that are supported by significant computing power at both ends of a communication link, nor even of the lightweight protocols listed above. There is a need for something significantly simpler One Time Codes Only proven security method by Shannon Entropy (1949) Provides Perfect Secrecy

Overview of the latest RFID Research 21 st March One time codes: 1 Have available a set of purely random numbers in the tag and matching tag dependent number in a secure data based Some are to authenticate the tag to a reader, some to authenticate a reader to a tag, some might be to permit authenticated change of tag identity to prevent trace of items Use certain of these to XOR with tag identities to disguise them from eavesdroppers.

Overview of the latest RFID Research 21 st March One time codes: 2 Need a large supply to cater for many authentications Options Reserve a pair for final authentication by end user Recharge in a secure environment Assume an eavesdropper cannot be every where and use old codes for identity change for fresh reader or tag authentications Better to use a shrinking function

Overview of the latest RFID Research 21 st March Shrinking Generators

Overview of the latest RFID Research 21 st March The Shrinking Function Two linear shift registers, A (data) and S (sampling), with different seeds, clocked together. Outputs are combined as follows If S is 1, output is A If S is 0, there is no output and another clock is applied This scheme has been resistant to cryptanalysis for 12 years. No known attacks if feedback polynomials are secret and registers are too long for an exhaustive search.

Overview of the latest RFID Research 21 st March Shrinking Generator Minimal hardware complexity Shrink the output from LFSR R1 Produce irregular sequence K Practical alternative to a one time pads Known attacks have exp time complexity  Keep connection polynomials secret  Use maximum length LFSRs LFSR R2 LFSR R1 Output (K) CE CLK D Q Buffer Clock

Overview of the latest RFID Research 21 st March Physically Uncloneable Functions in RFID

Overview of the latest RFID Research 21 st March Simple challenge-response protocol Reader chooses a challenge, x, which is a random number and transmits it to the label. The label computes and transmits the value y to the reader (here e is the encryption rule that is publicly known and K is a secret key known only to the reader and the particular label). The reader then computes. Then the reader verifies that. )(xey K 

Overview of the latest RFID Research 21 st March A lightweight primitive Physically Uncloneable Functions Easy to compute but hard to predict Alternative to storing keys on insecure hardware devices f(c 1,c 2,c 3,…,c m, k) { c 1,c 2,c 3,…,c m } }1,0{),...,,,( 321  n ccccc where {r}{r} }1,0{),...,,,( 321  m rrrrr k ={ gate and wire delay variations due to IC fabrication process variations}

Overview of the latest RFID Research 21 st March Use of PUFs on RFID tags to securely store keys 800 challenge-response pairs to uniquely identify over 10 9 chips PUF structure

Overview of the latest RFID Research 21 st March Tag authentication Use sets of challenges and responses to authenticate tags The response bit string can be compared with that stored in a secure database Similarly to a one time pad, challenges can not be used again

Overview of the latest RFID Research 21 st March Backend support A secure backend database is required to store challenge response pairs A secure method of distributing challenge response pairs are required Labels need to be characterised prior to deployment

Overview of the latest RFID Research 21 st March Lightweight hardware Use XOR operation to allow challenge sets to be reused simple to implement and low computation complexity

Overview of the latest RFID Research 21 st March Mutual authentication Use Reader generated Random numbers Reuse hardware on tag (CRC generator) Achieves mutual authentication and prevents unauthorised users from obtaining tag EPC

Overview of the latest RFID Research 21 st March Specialised RFID tag antenna design Tag Constraints Small UHF Animal Ear Tag (pigs) Small HF Animal Ear Tags (pigs, sheep) Compact Metal Mount Tags (UHF) Dual Frequency Tag Antennas

Overview of the latest RFID Research 21 st March RFID Tag Constraints Consist of Basic requirement: - Compact - Reliable - Inexpensive

Overview of the latest RFID Research 21 st March Small UHF Animal Ear Tags

Overview of the latest RFID Research 21 st March A Simple Loop Antenna Front view Back view

Overview of the latest RFID Research 21 st March UHF ear tag

Overview of the latest RFID Research 21 st March Small HF Animal Ear Tags

Overview of the latest RFID Research 21 st March HF ear tag

Overview of the latest RFID Research 21 st March Compact Metal Mount UHF Tag

Overview of the latest RFID Research 21 st March Metallic Environment Surrounding  Warehouses full of metallic shelves  Industrial area with heavy machinery Object to be identified Canned food Metallic mechanical parts Metallic beer kegs Challenge To get sufficient fields to reach RFID tag antenna near metal.

Overview of the latest RFID Research 21 st March Common Tag for Metallic Objects Conventional planar passive UHF RFID tags not suitable for metallic item identification. Existing RFID tags Normally big in area. To be small, need high dielectric constant substrate which may be expensive.

Overview of the latest RFID Research 21 st March Design Concept Small in size Hrec = 10 mm, Lrec = 25 mm, Wrec = 5 mm Exploits the theory of boundary conditions for better performance

Overview of the latest RFID Research 21 st March Compact UHF Metal Mount Tag The UHF antenna design for tagging metallic objects Small top loaded monopole above a ground with a series inductor to achieve a reasonable match to the RFID chip impedance.

Overview of the latest RFID Research 21 st March Dual Frequency Antenna UHF and HF

Overview of the latest RFID Research 21 st March Dual Frequency Antenna Supply Chain uses UHF Range Some Item Level Tagging application require HF Local Fields (reduced read range) No known impact on materials,  Pharmaceuticals Both UHF and HF Item Level Tagging workgroups defining an air interface protocol that is functionally equivalent Chip designs may soon be released that conform to both EPCglobal’s HF and UHF specifications Need for a two port dual frequency antenna

Overview of the latest RFID Research 21 st March Concept Merge HF loop antenna and UHF dipole antenna, by providing a matching circuit Transforms the UHF short circuit present at the HF antenna terminals to an open circuit at the UHF dipole HF antenna consists of overlapping coils to provide capacitance Gap on UHF antenna prevents short of HF antenna, but strip on underside provides a UHF path.

Overview of the latest RFID Research 21 st March Practical Example

Overview of the latest RFID Research 21 st March Conclusions

Overview of the latest RFID Research 21 st March Conclusions Auto-ID Lab, Adelaide setup to provide assistance to Australasian Industry in adopting EPCglobal technology Current research directed to RFID solutions in security, authentication, and anti-counterfeiting Public Key Cryptography and or Secret Channel, Symmetric Key, (eg: DES, newer AES) are all well established but cannot be applied, directly to RFID tags  Severe cost constraints and other limitations restrains the use of complex security engines Some approaches using one time codes, PUFs and shrinking functions are promising. Vulnerabilities are still being researched. Active research and development in small UHF and HF tag antennas

Overview of the latest RFID Research 21 st March Most papers and presentations on our website

Overview of the latest RFID Research 21 st March Questions

Overview of the latest RFID Research 21 st March Further Information Alfio Grasso Deputy Director Auto-ID Lab, Adelaide University of Adelaide Web: autoidlab.eleceng.adelaide.edu.au/autoidlab.eleceng.adelaide.edu.au/ Ph: Mob: