Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols

Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin Boyd, Juan Manuel González Nieto. Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols. In Aggelos Kiayias, editor, Topics in Cryptology - CT-RSA 2011 - The Cryptographers Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings. Volume 6558 of Lecture Notes in Computer Science, pages 284-301, Springer, 2011. [doi]

@inproceedings{StebilaKRBN11,
  title = {Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols},
  author = {Douglas Stebila and Lakshmi Kuppusamy and Jothi Rangasamy and Colin Boyd and Juan Manuel González Nieto},
  year = {2011},
  doi = {10.1007/978-3-642-19074-2_19},
  url = {http://dx.doi.org/10.1007/978-3-642-19074-2_19},
  tags = {protocol},
  researchr = {https://researchr.org/publication/StebilaKRBN11},
  cites = {0},
  citedby = {0},
  pages = {284-301},
  booktitle = {Topics in Cryptology - CT-RSA 2011 - The Cryptographers  Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings},
  editor = {Aggelos Kiayias},
  volume = {6558},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-19073-5},
}