Cryptographic Pattern Matching

Christoffer Rosenkilde Nielsen, Hanne Riis Nielson, Flemming Nielson

AbstractWe construct a language extension for process calculi for modelling
the exchange of cryptographically composed data. More specifically,
we devise a succinct syntax for terms and patterns that captures the
intention behind perfect cryptography. The proposed language
extension is independent of the choice of process calculus and is
applicable to any calculus that supports exchange of data. Initially
we restrict the model to symmetric cryptography, but we also show
how it can be extended with support for asymmetric encryption and
digital signatures.
KeywordsProcess Calculi, Pattern Matching, Cryptography, Formal Methods
TypeConference paper [With referee]
ConferenceSecond International Workshop on Views on Designing Complex Architectures (VODCA'06)
Year2007
PublisherInformatics and Mathematical Modelling, Technical University of Denmark, DTU
AddressRichard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby
SeriesElectronic Notes in Theoretical Computer Science
NoteTo Appear
BibTeX data [bibtex]
IMM Group(s)Computer Science & Engineering