Sciweavers

31 search results - page 4 / 7
» A new key authentication scheme for cryptosystems based on d...
Sort
View
ASIACRYPT
2001
Springer
13 years 11 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
EUROCRYPT
2001
Springer
13 years 12 months ago
NSS: An NTRU Lattice-Based Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU pu...
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverma...
CSJM
2006
114views more  CSJM 2006»
13 years 7 months ago
Cryptoschemes Based on New Signature Formation Mechanism
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
Alexander A. Moldovyan, Dmitriy N. Moldovyan, L. V...
CHES
2005
Springer
107views Cryptology» more  CHES 2005»
14 years 1 months ago
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
Jean-Sébastien Coron, David Lefranc, Guilla...
FC
2010
Springer
180views Cryptology» more  FC 2010»
13 years 8 months ago
Lighten Encryption Schemes for Secure and Private RFID Systems
We provide several concrete implementations of a generic method given by Vaudenay to construct secure privacy-preserving RFID authentication and identification systems. More precis...
Sébastien Canard, Iwen Coisel, Jonathan Etr...