Author:
Bellare Mihir,Micciancio Daniele
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. M. Ajtai, “Generating hard instances of lattice problems,” Proceedings of the 28th Annual Symposium on Theory of Computing, ACM, 1996.
2. Lect Notes Comput Sci;M. Bellare,1994
3. M. Bellare, O. Goldreich and S. Goldwasser, “Incremental cryptography with application to virus protection,” Proceedings of the 27th Annual Symposium on Theory of Computing, ACM, 1995.
4. M. Bellare and D. Micciancio, “A new paradigm for collision-free hashing: Incrementality at reduced cost,” full version of this paper, available at http://www-cse.ucsd.edu/users/mihir .
5. Lect Notes Comput Sci;M. Bellare,1995
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems;Lecture Notes in Computer Science;2024
2. Range-Based Set Reconciliation;2023 42nd International Symposium on Reliable Distributed Systems (SRDS);2023-09-25
3. Cryptographic Primitives;Advances in Information Security;2023-08-10
4. Verify, And Then Trust: Data Inconsistency Detection in ZooKeeper;Proceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data;2023-05-08
5. Pseudorandom Correlation Functions from Variable-Density LPN, Revisited;Lecture Notes in Computer Science;2023