A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Hash functions based on block ciphers: a synthetic approach
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Incremental cryptography and application to virus protection
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Oblivious data structures: applications to cryptography
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Introduction to Algorithms
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Incremental Cryptography: The Case of Hashing and Signing
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
RIPEMD-160: A Strengthened Version of RIPEMD
Proceedings of the Third International Workshop on Fast Software Encryption
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
Efficient cryptographic schemes provably as secure as subset sum
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Attacking the Chor-Rivest cryptosystem by improved lattice reduction
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Weaknesses in the SL2(IFs2) Hashing Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Practice-Oriented Provable Security
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
The State of Cryptographic Hash Functions
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Incremental Unforgeable Encryption
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
DeltaCast: efficient file reconciliation in wireless broadcast systems
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Listen and whisper: security mechanisms for BGP
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Proactive recovery in a Byzantine-fault-tolerant system
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
NS2: networked searchable store with correctness
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
Fast Software Encryption
Building a Collision-Resistant Compression Function from Non-compressing Primitives
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Hash Functions from Sigma Protocols and Improvements to VSH
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Zyzzyva: Speculative Byzantine fault tolerance
ACM Transactions on Computer Systems (TOCS)
FastAD: an authenticated directory for billions of objects
ACM SIGOPS Operating Systems Review
Cryptanalysis of a hash function based on quasi-cyclic codes
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Linear-XOR and additive checksums don't protect Damgård-Merkle hashes from generic attacks
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Distinguishers for the compression function and output transformation of hamsi-256
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
InstantCheck: Checking the Determinism of Parallel Programs Using On-the-Fly Incremental Hashing
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Fair and dynamic proofs of retrievability
Proceedings of the first ACM conference on Data and application security and privacy
Revisiting the security of the ALRED design
ISC'10 Proceedings of the 13th international conference on Information security
Zero-sum distinguishers for iterated permutations and application to KECCAK-f and Hamsi-256
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Efficient audit-based compliance for relational data retention
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Fine-grained latency and loss measurements in the presence of reordering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Fine-grained latency and loss measurements in the presence of reordering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Really fast syndrome-based hashing
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Faster and smoother: VSH revisited
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
APR-Quad: an update efficient authenticated dictionary for spatial data
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
Discrete logarithm variants of VSH
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Authentication of outsourced databases using signature aggregation and chaining
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Locating compromised sensor nodes through incremental hashing authentication
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
An efficient way to build secure disk
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Blind spontaneous anonymous group signatures for ad hoc groups
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Higher order universal one-way hash functions from the subset sum assumption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
VSH, an efficient and provable collision-resistant hash function
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Incremental deterministic public-key encryption
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Sketching in Adversarial Environments
SIAM Journal on Computing
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Towards fully incremental cryptographic schemes
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Access privacy and correctness on untrusted storage
ACM Transactions on Information and System Security (TISSEC)
| Hi-index | 0.00 |
We present a simple, new paradigm for the design of collision-free hash functions. Any function emanating from this paradigm is incremental. (This means that if a message x which I have previously hashed is modified to x′ then rather than having to re-compute the hash of x′ from scratch, I can quickly "update" the old hash value to the new one, in time proportional to the amount of modification made in x to get x′). Also any function emanating from this paradigm is parallelizable, useful for hardware implementation. We derive several specific functions from our paradigm. All use a standard hash function, assumed ideal, and some algebraic operations. The first function, MuHASH, uses one modular multiplication per block of the message, making it reasonably efficient, and significantly faster than previous incremental hash functions. Its security is proven, based on the hardness of the discrete logarithm problem. A second function, AdHASH, is even faster, using additions instead of multiplications, with security proven given either that approximation of the length of shortest lattice vectors is hard or that the weighted subset sum problem is hard. A third function, LtHASH, is a practical variant of recent lattice based functions, with security proven based, again on the hardness of shortest lattice vector approximation.