|
88
|
P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical
– M Bellare, Rogaway
- 1997
|
|
284
|
Universal One-Way Hash Functions and their Cryptographic Applications
– Moni Naor, Moti Yung
- 1989
|
|
231
|
A design principle for hash functions
– I Damgård
- 1989
|
|
62
|
Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions
– Daniel R. Simon
- 1998
|
|
138
|
One way hash functions and DES
– R Merkle
|
|
1130
|
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
– Mihir Bellare, Phillip Rogaway
- 1995
|
|
15
|
Hash Functions: From Merkle-Damgård to Shoup
– Ilya Mironov
- 2001
|
|
200
|
Optimal Asymmetric Encryption
– Mihir Bellare, Phillip Rogaway
- 1994
|
|
394
|
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
– Ronald Cramer, Victor Shoup
- 1998
|
|
41
|
One way hash functions and
– R C Merkle
- 1990
|
|
171
|
One-way functions are necessary and sufficient for secure signatures
– John Rompel
- 1990
|
|
711
|
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
– Shafi Goldwasser, Silvio Micali, Ronald L. Rivest
- 1995
|
|
94
|
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
– V. Shoup, R. Gennaro
- 1998
|
|
410
|
Non-Malleable Cryptography
– Danny Dolev, Cynthia Dwork, Moni Naor
- 2000
|
|
2057
|
Handbook of Applied Cryptography
– Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest
- 1997
|
|
163
|
How to Recycle Random Bits
– Russell Impagliazzo, David Zuckerman
- 1989
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
4
|
Construction of UOWHF: Tree Hashing Revisited,” Cryptology ePrint Archive
– P Sarkar
|
|
6
|
Domain Extenders for UOWHF: A Generic Lower Bound on Key Expansion And Finite Binary Tree Algorithm
– Palash Sarkar
- 2003
|
