Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ASIACRYPT
2001
Springer
11 years 5 months ago
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
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...
Duncan S. Wong, Agnes Hui Chan
ASIACRYPT
2001
Springer
11 years 5 months ago
Self-Blindable Credential Certificates from the Weil Pairing
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 ...
Eric R. Verheul
ASIACRYPT
2001
Springer
11 years 5 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
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...
Yuriy Tarannikov, Peter Korolev, Anton Botev
ASIACRYPT
2001
Springer
11 years 5 months ago
Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis
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...
Makoto Sugita, Kazukuni Kobara, Hideki Imai
ASIACRYPT
2001
Springer
11 years 5 months ago
Efficient Traitor Tracing Algorithms Using List Decoding
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...
Alice Silverberg, Jessica Staddon, Judy L. Walker
ASIACRYPT
2001
Springer
11 years 5 months ago
Secure Human Identification Protocols
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...
Nicholas J. Hopper, Manuel Blum
ASIACRYPT
2001
Springer
11 years 5 months ago
Short Signatures from the Weil Pairing
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...
Dan Boneh, Ben Lynn, Hovav Shacham
ASIACRYPT
2001
Springer
11 years 5 months ago
An Efficient Implementation of Braid Groups
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...
Jae Choon Cha, Ki Hyoung Ko, Sangjin Lee, Jae Woo ...
ASIACRYPT
2001
Springer
11 years 5 months ago
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
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...
Emmanuel Bresson, Olivier Chevassut, David Pointch...
ASIACRYPT
2001
Springer
11 years 5 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
books