Cryptographic Choreographies

๐Ÿ“… 2026-02-13
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF

Technology Category

Cognitive Modeling & Cognitive Systems: Symbolic RepresentationsKnowledge Representation and Reasoning: Logic ProgrammingData Mining & Knowledge Management: Representing, Reasoning, and Using Provenance, Trust

Application Category

Security and Privacy: Applications of cryptographySystems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deploymentsSemantics and Knowledge: Data modeling to support human-machine intelligence, including LLMs agents, intelligent system behavior, explanations, and user-friendly interactions
๐Ÿ“ Abstract
We present CryptoChoreo, a choreography language for the specification of cryptographic protocols. Choreographies can be regarded as an extension of Alice-and-Bob notation, providing an intuitive high-level view of the protocol as a whole (rather than specifying each protocol role in isolation). The extensions over standard Alice-and-Bob notation that we consider are non-deterministic choice, conditional branching, and mutable long-term memory. We define the semantics of CryptoChoreo by translation to a process calculus. This semantics entails an understanding of the protocol: it determines how agents parse and check incoming messages and how they construct outgoing messages, in the presence of an arbitrary algebraic theory and non-deterministic choices made by other agents. While this semantics entails algebraic problems that are in general undecidable, we give an implementation for a representative theory. We connect this translation to ProVerif and show on a number of case studies that the approach is practically feasible.
Problem

Research questions and friction points this paper is trying to address.

cryptographic protocols
choreography language
Alice-and-Bob notation
process calculus
algebraic theory
Innovation

Methods, ideas, or system contributions that make the work stand out.

choreography language
cryptographic protocols
process calculus
non-deterministic choice
formal verification
๐Ÿ”Ž Similar Papers
No similar papers found.
S
Sebastian Mรถdersheim
DTU Compute, Kgs. Lyngby, Denmark
S
Simon Lund
DTU Compute, Kgs. Lyngby, Denmark
Alessandro Bruni
Alessandro Bruni
Associate Professor. IT-University of Copenhagen
Static AnalysisModel CheckingDynamic AnalysisArtificial Intelligence
M
Marco Carbone
IT-University of Copenhagen, Denmark
R
Rosario Giustolisi
IT-University of Copenhagen, Denmark