Sciweavers

33 search results - page 5 / 7
» asiacrypt 2006
Sort
View
ASIACRYPT
2006
Springer
13 years 9 months ago
Relationship Between Standard Model Plaintext Awareness and Message Hiding
Abstract. Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard ...
Isamu Teranishi, Wakaha Ogata
ASIACRYPT
2006
Springer
13 years 9 months ago
Improved Collision Search for SHA-0
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although t...
Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Ya...
ASIACRYPT
2006
Springer
13 years 9 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
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
ASIACRYPT
2006
Springer
13 years 9 months ago
New Guess-and-Determine Attack on the Self-Shrinking Generator
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack condi...
Bin Zhang, Dengguo Feng