The following pages link to (Q3792624):
Displaying 34 items.
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Simple hash function using discrete-time quantum walks (Q1993832) (← links)
- On subset-resilient hash function families (Q2115743) (← links)
- \textsf{TEDT2} -- highly secure leakage-resilient TBC-based authenticated encryption (Q2146096) (← links)
- Pseudo-free families and cryptographic primitives (Q2154466) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Hash function based on quantum walks (Q2322065) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- Security analysis and improvement of a double-trapdoor encryption scheme (Q2572322) (← links)
- Key regeneration-free ciphertext-policy attribute-based encryption and its application (Q2660936) (← links)
- Cryptographic Hash Functions and Expander Graphs: The End of the Story? (Q2803636) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Concealment and Its Applications to Authenticated Encryption (Q3000035) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function (Q3503871) (← links)
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography (Q3506407) (← links)
- VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- Limits of Constructive Security Proofs (Q3600381) (← links)
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations (Q3623032) (← links)
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model (Q3627447) (← links)
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security (Q3634492) (← links)
- (Q4638056) (← links)
- New Constructions for Secure Hash Functions (Q4639447) (← links)
- Zero-Knowledge Sets with Short Proofs (Q5458606) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Quantum one-wayness of the single-round sponge with invertible permutations (Q6652987) (← links)
