A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost-Reference-Cited by-同舟云学术

A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost

Published:1997 Issue: Volume: Page:163-192
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT ’97
language:
Short-container-title:

Author:

Bellare Mihir,Micciancio Daniele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-69053-0_13

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 78 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems;Computer Security – ESORICS 2023;2024

2. 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

3. Robust Property-Preserving Hash Meets Homomorphism;Lecture Notes in Computer Science;2023

4. Pseudorandom Correlation Functions from Variable-Density LPN, Revisited;Lecture Notes in Computer Science;2023

5. Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding;Advances in Cryptology – CRYPTO 2023;2023