Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. Baillot, P., Barthe, G., & Lago, U. D. J. Autom. Reason., 63(4):813–855, 2019.
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs [link]Paper  doi  bibtex   
@article{DBLP:journals/jar/BaillotBL19,
  author       = {Patrick Baillot and
                  Gilles Barthe and
                  Ugo Dal Lago},
  title        = {Implicit Computational Complexity of Subrecursive Definitions and
                  Applications to Cryptographic Proofs},
  journal      = {J. Autom. Reason.},
  volume       = {63},
  number       = {4},
  pages        = {813--855},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10817-019-09530-2},
  doi          = {10.1007/S10817-019-09530-2},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/BaillotBL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0