ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
This paper describes truncated and impossible differential cryptanalysis of the 128-bit block cipher Camellia, which was proposed by NTT and Mitsubishi Electric Corporation. Our wo...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of prot...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parti...
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...