Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

DOI10.1007/978-3-662-48899-7_15zbMath1471.68053OpenAlexW2290798421MaRDI QIDQ3460055

Patrick Baillot, Gilles Barthe, Ugo Dal Lago

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48899-7_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs

This page was built for publication: Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs