10 search results - page 2 / 2 » A New Provably Secure Authentication and Key Agreement Mecha... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
WCC
2005
Springer
13 years 10 months ago
2005
Springer
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
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...
CTRSA
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...