Distributed Merkle's puzzles
From MaRDI portal
Recommendations
- Merkle puzzles in a quantum world
- On distributed Merlin-Arthur decision protocols
- Nested Merkle's puzzles against sampling attacks
- scientific article; zbMATH DE number 1947519
- scientific article; zbMATH DE number 1583780
- On the method of puzzles for key distribution
- scientific article; zbMATH DE number 1186864
- scientific article; zbMATH DE number 5295623
- Distributed Public-Key Cryptography from Weak Secrets
- scientific article; zbMATH DE number 907956
Cites work
- A conference key distribution system
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- scientific article; zbMATH DE number 176546 (Why is no real title available?)
- scientific article; zbMATH DE number 1024078 (Why is no real title available?)
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- New directions in cryptography
- On the Communication Complexity of Key-Agreement Protocols.
- On Yao's XOR-lemma
- Perfectly secure message transmission
- Probability and Computing
- Secure communications over insecure channels
- The Complexity of Public-Key Cryptography
- The diameter of sparse random graphs
Cited in
(12)- Key establishment à la Merkle in a quantum world
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- On the method of puzzles for key distribution
- scientific article; zbMATH DE number 1947518 (Why is no real title available?)
- scientific article; zbMATH DE number 1947519 (Why is no real title available?)
- Nested Merkle's puzzles against sampling attacks
- On the Communication Complexity of Key-Agreement Protocols.
- Merkle puzzles in a quantum world
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- Communication lower bounds of key-agreement protocols via density increment arguments
- Fine-grained non-interactive key exchange, revisited
This page was built for publication: Distributed Merkle's puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697863)