Computational complexity and implementation aspects of the incremental hash function
暂无分享,去创建一个
[1] Mihir Bellare,et al. Incremental cryptography and application to virus protection , 1995, STOC '95.
[2] Daniele Micciancio,et al. Oblivious data structures: applications to cryptography , 1997, STOC '97.
[3] Marc Fischlin. Incremental Cryptography and Memory Checkers , 1997, EUROCRYPT.
[4] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[5] Moni Naor,et al. Efficient cryptographic schemes provably as secure as subset sum , 2004, Journal of Cryptology.
[6] Mihir Bellare,et al. XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.
[7] Mohammad Umar Siddiqi,et al. Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining , 2001, INDOCRYPT.
[8] Mihir Bellare,et al. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost , 1997, EUROCRYPT.
[9] Marc Fischlin. Lower bounds for the signature size of incremental schemes , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[10] David A. Wagner,et al. A Generalized Birthday Problem , 2002, CRYPTO.
[11] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[12] Mihir Bellare,et al. Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.