Sciweavers

3 search results - page 1 / 1
» A New NP-Complete Problem and Public-Key Identification
Sort
View
48
Voted
DCC
2003
IEEE
15 years 9 months ago
A New NP-Complete Problem and Public-Key Identification
David Pointcheval, Guillaume Poupard
ASIACRYPT
2001
Springer
15 years 1 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
ESORICS
2010
Springer
14 years 10 months ago
Readers Behaving Badly - Reader Revocation in PKI-Based RFID Systems
Abstract. Recent emergence of RFID tags capable of performing public key operations motivates new RFID applications, including electronic travel documents, identification cards and...
Rishab Nithyanand, Gene Tsudik, Ersin Uzun