VSH, an Efficient and Provable Collision-Resistant Hash Function

DOI10.1007/11761679_11zbMATH Open1140.94331OpenAlexW1583471030MaRDI QIDQ3593095FDOQ3593095

Arjen K. Lenstra, Ron Steinfeld, Scott Contini

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_11

Recommendations

• Faster and smoother -- VSH revisited
• Security of VSH in the Real World
• Hash Functions from Sigma Protocols and Improvements to VSH
• Statistical distribution and collisions of VSH
• scientific article

zbMATH Keywords

hashinginteger factoringprovable reducibility

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The development of the number field sieve
• Title not available (Why is that?)
• Title not available (Why is that?)
• Public Key Cryptography – PKC 2004
• Fast Software Encryption
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• Title not available (Why is that?)
• Designated Verifier Proofs and Their Applications
• Title not available (Why is that?)
• Factoring estimates for a 1024-bit RSA modulus
• Title not available (Why is that?)

Cited In (30)

• An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
• Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
• On a family of preimage-resistant functions
• Provably convertible multi-authenticated encryption scheme for generalized group communications
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• Analysis of Multivariate Hash Functions
• Cryptanalysis of Grindahl
• Interpreting Hash Function Security Proofs
• Hash Functions from Sigma Protocols and Improvements to VSH
• Efficient reductions and algorithms for subset product
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
• Whirlwind: a new cryptographic hash function
• Statistical distribution and collisions of VSH
• Faster cryptographic hash function from supersingular isogeny graphs
• VSH and multiplicative modular relations between small primes with polynomial exponents
• Building Secure Block Ciphers on Generic Attacks Assumptions
• Cryptographic hash functions from expander graphs
• Compositions of linear functions and applications to hashing
• Collision attack on \({\mathtt Grindahl}\)
• A characterization of chameleon hash functions and new, efficient designs
• Self-certified multi-proxy signature schemes with message recovery
• How to Build a Hash Function from Any Collision-Resistant Function
• Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
• Comparing with RSA
• Security of VSH in the Real World
• Linearization Attacks Against Syndrome Based Hashes
• An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem
• Robust digital signature revisited
• Bad Directions in Cryptographic Hash Functions

This page was built for publication: VSH, an Efficient and Provable Collision-Resistant Hash Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593095)