Merkle Puzzles in a Quantum World

@inproceedings{Brassard2011MerklePI,
  title={Merkle Puzzles in a Quantum World},
  author={Gilles Brassard and Peter H\oyer and Kassem Kalach and Marc Kaplan and Sophie Laplante and Louis Salvail},
  booktitle={CRYPTO},
  year={2011}
}
In 1974, Ralph Merkle proposed the first unclassified scheme for secure communications over insecure channels. When legitimate communicating parties are willing to spend an amount of computational effort proportional to some parameter N , an eavesdropper cannot break into their communication without spending a time proportional to N, which is quadratically more than the legitimate effort. We showed in an earlier paper that Merkle’s schemes are completely insecure against a quantum adversary… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Facsimile available at http://www. merkle.com/1974

  • R. Merkle, “C.S
  • Project Proposal”,
  • 1974
Highly Influential
5 Excerpts

Barak and M . Mahmoody – Ghidary , “ Merkle puzzles are optimal — An O ( n 2 ) – query attack on any key exchange from a random oracle ”

  • C. H. Bennett, E. Bernstein, G. Brassard, U. V. Vazirani
  • Advances in Cryptology – Proceedings of Crypto
  • 2009

Mahmoody–Ghidary, “Merkle puzzles are optimal — An O(n2)– query attack on any key exchange from a random oracle

  • M. B. Barak
  • Advances in Cryptology – Proceedings of Crypto
  • 2009
2 Excerpts

Finding matches between two databases on a quantum computer

  • M. Heiligman
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…