Pages that link to "Item:Q1894973"
From MaRDI portal
The following pages link to Necessary and sufficient conditions for collision-free hashing (Q1894973):
Displaying 7 items.
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- (Q4318713) (← links)
- Theory of Cryptography (Q5711657) (← links)