A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Improved Online/Offline Signature Schemes
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
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
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
The Composite Discrete Logarithm and Secure Authentication
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A new paradigm for collision-free hashing: incrementality at reduced cost
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Efficient multicast stream authentication for the fully adversarial network model
International Journal of Security and Networks
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
Information Security and Cryptology
Full Cryptanalysis of LPS and Morgenstern Hash Functions
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
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
General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The State of Hash Functions and the NIST SHA-3 Competition
Information Security and Cryptology
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Achieving end-to-end authentication in intermediary-enabled multimedia delivery systems
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
On building hash functions from multivariate quadratic equations
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Combining prediction hashing and MDS codes for efficient multicast stream authentication
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Analysis of multivariate hash functions
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Linearization attacks against syndrome based hashes
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
An hybrid approach for efficient multicast stream authentication over unsecured channels
ProvSec'07 Proceedings of the 1st international conference on Provable security
How to build a hash function from any collision-resistant function
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
DAKOTA: hashing from a combination of modular arithmetic and symmetric cryptography
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Whirlwind: a new cryptographic hash function
Designs, Codes and Cryptography
Certificateless authenticated group key agreement protocol for unbalanced wireless mobile networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Preimage attacks against variants of very smooth hash
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Interpreting hash function security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Faster and smoother: VSH revisited
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Searching for compact algorithms: CGEN
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
General conversion for obtaining strongly existentially unforgeable signatures
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
How to strengthen any weakly unforgeable signature into a strongly unforgeable signature
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
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
Provably convertible multi-authenticated encryption scheme for generalized group communications
Information Sciences: an International Journal
Communication efficient shuffle for mental poker protocols
Information Sciences: an International Journal
Strong security from probabilistic signature schemes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
SPN-hash: improving the provable resistance against differential collision attacks
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 0.00 |
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-bit composite. By very smooth, we mean that the smoothness bound is some fixed polynomial function of S. We argue that finding collisions for VSH has the same asymptotic complexity as factoring using the Number Field Sieve factoring algorithm, i.e., subexponential in S. VSH is theoretically pleasing because it requires just a single multiplication modulo the S-bit composite per Ω(S) message-bits (as opposed to O(logS) message-bits for previous provably secure hashes). It is relatively practical. A preliminary implementation on a 1GHz Pentium III processor that achieves collision resistance at least equivalent to the difficulty of factoring a 1024-bit RSA modulus, runs at 1.1 MegaByte per second, with a moderate slowdown to 0.7MB/s for 2048-bit RSA security. VSH can be used to build a fast, provably secure randomised trapdoor hash function, which can be applied to speed up provably secure signature schemes (such as Cramer-Shoup) and designated-verifier signatures.