Sciweavers

38 search results - page 7 / 8
» asiacrypt 2001
Sort
View
ASIACRYPT
2001
Springer
13 years 9 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
13 years 9 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
2003
Springer
13 years 10 months ago
Cryptanalysis of the Public-Key Encryption Based on Braid Groups
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
Eonkyung Lee, Je Hong Park
ASIACRYPT
2010
Springer
13 years 2 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
ASIACRYPT
2004
Springer
13 years 11 months ago
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...