How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Lenstra's factorisation method based on elliptic curves
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Two remarks concerning the Goldwasser-Micali-Rivest signature scheme
Proceedings on Advances in cryptology---CRYPTO '86
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
Theory of Codes
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A "Paradoxical" Solution To The Signature Problem
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
On the design of provably-secure cryptographic hash functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A remark on signature scheme where forgery can be proved
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A design principle for hash functions
CRYPTO '89 Proceedings on Advances in cryptology
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Structural Properties of One-way Hash Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
How to Time-Stamp a Digital Document
CRYPTO '90 Proceedings of the 10th 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
Necessary and Sufficient Conditions For Collision-Free Hashing
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Differential Attack on Message Authentication Codes
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
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: The Case of Hashing and Signing
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Robustness Principles for Public Key Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Escure Signature Schemes based on Interactive Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fail-Stop Signature for Long Messages
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Efficient "on the Fly" Signature Schemes Based on Integer Factoring
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
The State of Cryptographic Hash Functions
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
A Security Framework for Card-Based Systems
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
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
New Constructions for Secure Hash Functions
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Commitment Schemes and Zero-Knowledge Protocols
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
On Optimal Hash Tree Traversal for Interval Time-Stamping
ISC '02 Proceedings of the 5th International Conference on Information Security
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
Theoretical Computer Science
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
The State of Hash Functions and the NIST SHA-3 Competition
Information Security and Cryptology
Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Domain extension for enhanced target collision-resistant hash functions
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Enhanced security notions for dedicated-key hash functions: definitions and relationships
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Complexity classes of equivalence problems revisited
Information and Computation
Critique of the related-key attack concept
Designs, Codes and Cryptography
Enabling the archival storage of signed documents
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Combinatorial group testing for corruption localizing hashing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Cryptography in constant parallel time
Cryptography in constant parallel time
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Discrete logarithm variants of VSH
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Some plausible constructions of double-block-length hash functions
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Cramer-Damgård signatures revisited: efficient flat-tree signatures based on factoring
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Sufficient conditions for collision-resistant hashing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the generic insecurity of the full domain hash
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An efficient convertible undeniable signature scheme with delegatable verification
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Using automated banking certificates to detect unauthorised financial transactions
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Applications of SAT solvers to cryptanalysis of hash functions
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
New online/offline signature schemes without random oracles
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
The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Data forensics constructions from cryptographic hashing and coding
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
International Journal of High Performance Computing and Networking
Hi-index | 0.00 |
In this paper, we present a construction of hash functions. These functions are collision free in the sense that under some cryptographic assumption, it is provably hard for an enemy to find collisions. Assumptions that would be sufficient are the hardness of factoring, of discrete log, or the (possibly) more general assumption about the existence of claw free sets of permutations. The ability of a hash function to improve security and speed of a signature scheme is discussed: for example, we can combine the RSA-system with a collision free hash function based on factoring to get a scheme which is more efficient and much more secure. Also, the effect of combining the Goldwasser-Micali-Rest signature scheme with one of our functions is studied. In the factoring based implementation of the scheme using a k-bit modulus, the signing process can be speeded up by a factor roughly equal to kċO (log2(k)), while the signature checking process will be faster by a factor of O (log2(k)).