In 2008, Groth and Sahai proposed a powerful suite of techniques for constructing non-interactive zero-knowledge proofs in bilinear groups. Their proof systems have found numerous applications, including group signature schemes, anonymous voting, and anonymous credentials. In this paper, the authors demonstrate that the notion of smooth projective hash functions can ...Download Now
In this paper, the authors present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C encryption and signature scheme that was broken in 1995 by Patarin. In SFLASH, the public key is truncated, and this simple countermeasure prevents Patarin's attack. The ...Download Now
SC2000 is a 128-bit block cipher with a user key of 128, 192 or 256 bits, which employs a total of 6.5 rounds for a 128-bit user key, and a total of 7.5 rounds for a 192 or 256-bit key. It was designed to "Have high performance on a wide ...Download Now
In this paper the authors study the security of the SHA-3 candidate SIMD. They first show a new free-start distinguisher based on symmetry relations. It allows distinguishing the compression function of SIMD from a random function with a single evaluation. However, they also show that this property is very hard ...Download Now
Submit Your Content
Get your content listed in our directory for free!
Our directory is the largest library of vendor-supplied technical content on the web. It's also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors' papers here - shouldn't they find yours too?