Sciweavers

40 search results - page 6 / 8
» asiacrypt 2009
Sort
View
ASIACRYPT
2009
Springer
14 years 18 days ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
ASIACRYPT
2010
Springer
13 years 3 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
ICISC
2009
163views Cryptology» more  ICISC 2009»
13 years 3 months ago
Improved Linear Cryptanalysis of SOSEMANUK
The SOSEMANUK stream cipher is one of the finalists of the eSTREAM project. In this paper, we improve the linear cryptanalysis of SOSEMANUK presented in Asiacrypt 2008. We apply th...
Joo Yeon Cho, Miia Hermelin
IACR
2011
161views more  IACR 2011»
12 years 5 months ago
Roots of Square: Cryptanalysis of Double-Layer Square and Square+
Abstract. Square is a multivariate quadratic encryption scheme proposed in 2009. It is a specialization of Hidden Field Equations by using only odd characteristic elds and also X2...
Enrico Thomae, Christopher Wolf
ASIACRYPT
2009
Springer
14 years 18 days ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan