Pages that link to "Item:Q5252662"

The following pages link to Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662):

Displayed 27 items.

• Limits on the usefulness of random oracles (Q290382) ‎ (← links)
• Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) ‎ (← links)
• On subset-resilient hash function families (Q2115743) ‎ (← 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)
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) ‎ (← links)
• On constructing one-way permutations from indistinguishability obfuscation (Q2413613) ‎ (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) ‎ (← links)
• On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) ‎ (← links)
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) ‎ (← links)
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) ‎ (← links)
• Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) ‎ (← links)
• Parallel Hashing via List Recoverability (Q3457065) ‎ (← links)
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) ‎ (← links)
• (Q4638056) ‎ (← links)
• The Many Entropies in One-Way Functions (Q5021132) ‎ (← links)
• On the Communication Complexity of Key-Agreement Protocols. (Q5090417) ‎ (← links)
• Structure Versus Hardness Through the Obfuscation Lens (Q5149758) ‎ (← links)
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) ‎ (← links)
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) ‎ (← links)
• Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) ‎ (← links)
• A random oracle for all of us (Q6103097) ‎ (← links)
• On the impossibility of key agreements from quantum random oracles (Q6104333) ‎ (← links)
• Collision-resistance from multi-collision-resistance (Q6108993) ‎ (← links)
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions (Q6108995) ‎ (← links)
• General properties of quantum bit commitments (extended abstract) (Q6134002) ‎ (← links)
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP (Q6157505) ‎ (← links)