L–PEP: a logic to reason about privacy–enhancing cryptography protocols

Abstract

In recent years, many cryptography protocols have been designed, for many different scenarios, with the purpose of preserving security of communications as well as privacy and anonymity of participant entities. In general, every proposed solution has possed a real challenge to the existing formal methods of protocol analysis and verification. The main goal of this work is the proposal of a logic to reason about privacy-enhancing monotonic and non-monotonic cryptography protocols. The new logic will be called L-PEP and it extends the existing Rubin's logic of beliefs.