scientific article
From MaRDI portal
Publication:3792624
zbMath0647.94011MaRDI QIDQ3792624
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
hash functionscollision freeRSA-systemGoldwasser-Micali-Rivest signature schemesecurity and speed of a signature scheme
Related Items (35)
\textsf{TEDT2} -- highly secure leakage-resilient TBC-based authenticated encryption ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Practical and provably secure release of a secret and exchange of signatures ⋮ Pseudo-free families and cryptographic primitives ⋮ On the existence of statistically hiding bit commitment schemes and fail-stop signatures ⋮ On-line/off-line digital signatures ⋮ Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring ⋮ Key regeneration-free ciphertext-policy attribute-based encryption and its application ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Concealment and Its Applications to Authenticated Encryption ⋮ New Constructions for Secure Hash Functions ⋮ Simple hash function using discrete-time quantum walks ⋮ Efficient hybrid encryption from ID-based encryption ⋮ VSH, an Efficient and Provable Collision-Resistant Hash Function ⋮ Complexity classes of equivalence problems revisited ⋮ Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Limits of Constructive Security Proofs ⋮ Cryptographic Hash Functions and Expander Graphs: The End of the Story? ⋮ Zero-Knowledge Sets with Short Proofs ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Characterizing Padding Rules of MD Hash Functions Preserving Collision Security ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Hash function based on quantum walks ⋮ Security analysis and improvement of a double-trapdoor encryption scheme ⋮ Unnamed Item ⋮ On subset-resilient hash function families
This page was built for publication:
