On higher-order cryptography

DOI10.4230/LIPICS.ICALP.2020.108MaRDI QIDQ6842462zbMATH OpenFDO

Authors Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.108

zbMATH Keywords

cryptographygame semanticshigher-order computationprobabilistic computation

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A core quantitative coeffect calculus
• A linguistic characterization of bounded oracle computation and probabilistic polynomial time
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Abstract machines for game semantics, revisited
• Bounded linear logic: A modular approach to polynomial-time computability
• Complexity theory for operators in analysis
• Foundations of Cryptography
• Full abstraction for PCF
• Fully abstract models of the probabilistic -calculus
• Game semantics approach to higher-order complexity
• Games and full completeness for multiplicative linear logic
• Geometry of synthesis: a structured approach to VLSI design
• Higher-order computability
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 1241700 (Why is no real title available?)
• Linear logic
• Modular verification of security protocol code by typing
• On full abstraction for PCF: I, II and III
• On the security of public key protocols
• Probabilistic game semantics

This page was built for publication: On higher-order cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842462)