A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 163-192
- https://doi.org/10.1007/3-540-69053-0_13
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis ,2018
- Oblivious data structuresPublished by Association for Computing Machinery (ACM) ,1997
- Efficient cryptographic schemes provably as secure as subset sumJournal of Cryptology, 1996
- Incremental cryptography and application to virus protectionPublished by Association for Computing Machinery (ACM) ,1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Computer Security and Industrial CryptographyPublished by Springer Nature ,1993
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient cryptographic schemes provably as secure as subset sumPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982