Formal security proofs with minimal fuss: Implicit computational complexity at work. Nowak, D. & Zhang, Y. Inf. Comput., 241:96–113, 2015.
Formal security proofs with minimal fuss: Implicit computational complexity at work [link]Paper  doi  bibtex   
@article{DBLP:journals/iandc/NowakZ15,
  author    = {David Nowak and
               Yu Zhang},
  title     = {Formal security proofs with minimal fuss: Implicit computational complexity
               at work},
  journal   = {Inf. Comput.},
  volume    = {241},
  pages     = {96--113},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.ic.2014.10.008},
  doi       = {10.1016/j.ic.2014.10.008},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iandc/NowakZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0