Distributed Merkle's puzzles

DOI10.1007/978-3-030-90453-1_11OpenAlexW3211748058MaRDI QIDQ2697863

Ben Hasson, Itai Dinur

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_11

zbMATH Keywords

key agreement protocolquery complexity of each honest player

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Fine-grained non-interactive key-exchange: constructions and lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• Secure communications over insecure channels
• On Yao’s XOR-Lemma
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
• New directions in cryptography
• A conference key distribution system
• Perfectly secure message transmission
• The Complexity of Public-Key Cryptography
• On the Communication Complexity of Key-Agreement Protocols.
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• Probability and Computing
• The diameter of sparse random graphs

This page was built for publication: Distributed Merkle's puzzles