VSH, an Efficient and Provable Collision-Resistant Hash Function

DOI10.1007/11761679_11zbMath1140.94331OpenAlexW1583471030MaRDI QIDQ3593095

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

zbMATH Keywords

hashinginteger factoringprovable reducibility

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Designated Verifier Proofs and Their Applications
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Public Key Cryptography – PKC 2004
• Advances in Cryptology - ASIACRYPT 2003

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