A Highly Scalable RFID Authentication Protocol
From MaRDI portal
Publication:3634505
DOI10.1007/978-3-642-02620-1_25zbMath1284.94147OpenAlexW1505067391MaRDI QIDQ3634505
Publication date: 25 June 2009
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_25
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Oblivious transfer and polynomial evaluation
- Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Reducing Time Complexity in RFID Systems
- Oblivious Polynomial Evaluation
- Financial Cryptography and Data Security
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Highly Scalable RFID Authentication Protocol