Furthermore, in contrast to specific assumptions like the difficulty of factoring large integers, they allow to base a system's security on very general cryptographic assumptions.
D. Bleichenbacher and U. M. Maurer, "Optimal Tree-Based One-Time Digital Signature Schemes", in 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, Prancis, 1996, pp. 361-374.
M. Bellare and P. Rogaway, "Collision-Resistant Hashing: Towards Making UOWHFs Practical", in 17th Annual International Cryptology Conference – CRYPTO, Aula Campbell, UCSB, jalan Mesa, Isla Vista, Santa Barbara, California, 93117, Amerika Serikat, 1997, pp. 470-484.
Kamis, 21 Agustus 1997, 09.00
If a certain amount of risk is acceptable, then one could use less-studied signature algorithms. This approach could provide fast yet secure authentication provided the underlying cryptographic assumptions are valid. In , a weaker condition on the hash function called Target Collision Resistance or TCR would suffice. (such func