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.
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
{"_id":"7bNoiuminYgktSaEG","bibbaseid":"baillot-barthe-lago-implicitcomputationalcomplexityofsubrecursivedefinitionsandapplicationstocryptographicproofs-2019","author_short":["Baillot, P.","Barthe, G.","Lago, U. D."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Patrick"],"propositions":[],"lastnames":["Baillot"],"suffixes":[]},{"firstnames":["Gilles"],"propositions":[],"lastnames":["Barthe"],"suffixes":[]},{"firstnames":["Ugo","Dal"],"propositions":[],"lastnames":["Lago"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/jar/BaillotBL19,\n author = {Patrick Baillot and\n Gilles Barthe and\n Ugo Dal Lago},\n title = {Implicit Computational Complexity of Subrecursive Definitions and\n Applications to Cryptographic Proofs},\n journal = {J. Autom. Reason.},\n volume = {63},\n number = {4},\n pages = {813--855},\n year = {2019},\n url = {https://doi.org/10.1007/s10817-019-09530-2},\n doi = {10.1007/S10817-019-09530-2},\n timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/jar/BaillotBL19.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Baillot, P.","Barthe, G.","Lago, U. D."],"key":"DBLP:journals/jar/BaillotBL19","id":"DBLP:journals/jar/BaillotBL19","bibbaseid":"baillot-barthe-lago-implicitcomputationalcomplexityofsubrecursivedefinitionsandapplicationstocryptographicproofs-2019","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10817-019-09530-2"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/44/3105.bib","dataSources":["YqxpDqzvaehKMgHN9"],"keywords":[],"search_terms":["implicit","computational","complexity","subrecursive","definitions","applications","cryptographic","proofs","baillot","barthe","lago"],"title":"Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs","year":2019}