VSH, an Efficient and Provable Collision-Resistant Hash Function
From MaRDI portal
(Redirected from Publication:3593095)
Recommendations
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 176568 (Why is no real title available?)
- scientific article; zbMATH DE number 1088251 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 1842501 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 1440053 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - CRYPTO 2003
- Designated verifier proofs and their applications
- Factoring estimates for a 1024-bit RSA modulus
- Fast Software Encryption
- Public Key Cryptography – PKC 2004
- The development of the number field sieve
- VSH, an Efficient and Provable Collision-Resistant Hash Function
Cited in
(34)- Public-algorithm substitution attacks: subverting hashing and verification
- 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
- Bivariate polynomials modulo composites and their applications
- 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
- Hash Functions from Sigma Protocols and Improvements to VSH
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Efficient reductions and algorithms for subset product
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Whirlwind: a new cryptographic hash function
- Statistical distribution and collisions of VSH
- VSH and multiplicative modular relations between small primes with polynomial exponents
- Faster cryptographic hash function from supersingular isogeny graphs
- Cryptographic hash functions from expander graphs
- Building Secure Block Ciphers on Generic Attacks Assumptions
- Compositions of linear functions and applications to hashing
- Collision attack on \({\mathtt Grindahl}\)
- A characterization of chameleon hash functions and new, efficient designs
- Bad directions in cryptographic hash functions
- Self-certified multi-proxy signature schemes with message recovery
- Interpreting hash function security proofs
- Discrete logarithm variants of VSH
- 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
- Robust digital signature revisited
- Faster and smoother -- VSH revisited
- An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem
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)
