Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Crossref DOI link: https://doi.org/10.1007/s10817-019-09530-2
Published Online: 2019-07-31
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Baillot, Patrick
Barthe, Gilles
Dal Lago, Ugo http://orcid.org/0000-0001-9200-070X
Text and Data Mining valid from 2019-07-31
Version of Record valid from 2019-07-31
Article History
Received: 20 February 2017
Accepted: 17 July 2019
First Online: 31 July 2019