scientific article; zbMATH DE number 177052
From MaRDI portal
Publication:4036897
Recommendations
Cited in
(25)- Expedient Non-malleability Notions for Hash Functions
- Low-complexity cryptographic hash functions
- scientific article; zbMATH DE number 1504778 (Why is no real title available?)
- Indistinguishable proofs of work or knowledge
- Interpreting hash function security proofs
- Some observations on the cryptographic hash functions
- Some observations on the theory of cryptographic hash functions
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Public Key Cryptography - PKC 2006
- Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
- Reducing complexity assumptions for statistically-hiding commitment
- Formalizing human ignorance
- scientific article; zbMATH DE number 1676656 (Why is no real title available?)
- A collision-free cryptographic hash function based on factorization
- New Constructions for Secure Hash Functions
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- scientific article; zbMATH DE number 7121810 (Why is no real title available?)
- scientific article; zbMATH DE number 697806 (Why is no real title available?)
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- A composition theorem for universal one-way hash functions
- scientific article; zbMATH DE number 1583806 (Why is no real title available?)
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036897)
