CryptoDB
Merkle Puzzles Are Optimal - An <i>O</i>(<i>n</i><sup>2</sup>)-Query Attack on Any Key Exchange from a Random Oracle
Authors: | |
---|---|
Download: |
|
Conference: | CRYPTO 2009 |
BibTeX
@inproceedings{crypto-2009-23891, title={Merkle Puzzles Are Optimal - An <i>O</i>(<i>n</i><sup>2</sup>)-Query Attack on Any Key Exchange from a Random Oracle}, booktitle={Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference}, series={Lecture Notes in Computer Science}, publisher={Springer}, volume={5677}, pages={374-390}, url={https://www.iacr.org/archive/crypto2009/56770369/56770369.pdf}, doi={10.1007/978-3-642-03356-8_22}, author={Boaz Barak and Mohammad Mahmoody-Ghidary}, year=2009 }