Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

Patrick Baillot, Gilles Barthe, Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. In Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. Volume 9450 of Lecture Notes in Computer Science, pages 203-218, Springer, 2015. [doi]

Abstract

Abstract is missing.