Pages that link to "Item:Q3183575"

The following pages link to Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle (Q3183575):

Displaying 29 items.

• Limits on the usefulness of random oracles (Q290382) (← links)
• Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
• One-way functions imply secure computation in a quantum world (Q2120090) (← links)
• Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
• On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
• On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
• Key establishment à la Merkle in a quantum world (Q2318085) (← 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 actively-secure elementary MPC reductions (Q2695655) (← links)
• Distributed Merkle's puzzles (Q2697863) (← links)
• Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
• Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
• (Q4637977) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)
• On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
• Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
• Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
• Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
• On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)
• Communication lower bounds of key-agreement protocols via density increment arguments (Q6582217) (← links)
• Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
• Fine-grained non-interactive key exchange, revisited (Q6648208) (← links)
• On sequential functions and fine-grained cryptography (Q6652975) (← links)
• How (not) to build quantum PKE in Minicrypt (Q6653006) (← links)
• On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)