Structural properties of one-way hash functions (1991)

Cached

Download Links

by Yuliang Zheng , Tsutomu Matsumoto , Hideki Imai
Venue:Advances in cryptology - CRYPTO 90, Lecture Notes in Computer Science
Citations:13 - 5 self

Active Bibliography

2 Connections among Several Versions of One-Way Hash Functions – Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai - 1990
9 Necessary and Sufficient Conditions for Collision-Free Hashing – Alexander Russell - 1995
24 Reducing complexity assumptions for statistically-hiding commitment – Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel - 2005
7 Duality between two cryptographic primitives – Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai - 1990
1 Cryptography in Constant Parallel Time – Benny Applebaum - 2007
243 The Random Oracle Methodology, Revisited – Ran Canetti, Oded Goldreich, Shai Halevi - 1998
8 Sibling intractable function families and their applications – Yuliang Zheng, Thomas Hardjono, Josef Pieprzyk - 1992
12 New Solutions to the Problem of Access Control in a Hierarchy – Yuliang Zheng, Thomas Hardjono, Jennifer Seberry - 1993
7 Bounds on the efficiency of “blackbox” commitment schemes – Omer Horvitz, Jonathan Katz - 2005
51 Security Preserving Amplification of Hardness – Oded Goldreich, Russell Impagliazzo, Leonid Levin, Ramarathnam Venkatesan, David Zuckerman - 1990
24 The Classification of Hash Functions – Ross Anderson - 1993
20 Statistical Zero-Knowledge Arguments for NP from Any One-Way – Minh-Huyen Nguyen, Shien Jin Ong, Salil Vadhan - 2006
Perfectly One-Way Probabilistic Hash Functions – Preliminary Version Ran, Ran Canetti, Daniele Micciancio, Omer Reingold
17 Statistical Secrecy and Multi-Bit Commitments – Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann - 1996
73 Perfectly One-Way Probabilistic Hash Functions – Ran Canetti, Daniele Micciancio, Omer Reingold
14 Interactive Hashing Simplifies Zero-Knowledge Protocol Design (Extended Abstract) – Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung - 1998
6 On the Black-Box Complexity of Optimally-Fair Coin Tossing – Dana Dachman-soled, Yehuda Lindell, Mohammad Mahmoody
447 Non-Malleable Cryptography – Danny Dolev, Cynthia Dwork, Moni Naor - 2000
203 How to Time-stamp a Digital Document – Stuart Haber, W. Scott Stornetta - 1991