Verifying Privacy Enhanced Mail Functions with Higher Order Logic (1998) [2 citations — 2 self]
|
Abstract:
Abstract. Security properties such as privacy, authentication, and integrity are of increasing importance to networked systems([KAU]). Systems with security requirements typically must operate with a high degree of confidence. We show how the message structures of Privacy Enhanced Mail (PEM, [LIN, BAL]) and the functions on PEM structures have the desired implementation-independent security properties. Higher-order logic ([AND]) and the HOL theorem-prover([GOR]) are used to precisely relate security properties to system specifications. The structures of MIC-CLEAR and ENCRYPTED messages are modeled as tuples of fields. Each of these fields is modeled as a type which takes only a limited set of values as valid ([MEL]). Security functions for checking privacy, integrity, source authentication and non-repudiation of received messages are defined in HOL. They take as parameters a subset of fields defined above. It is proved that mail messages have these security properties if-and-only-if mail messages satisfy the security functions. 1.
Citations
| 206 | C.: HOL: A proof generating system for Higher-Order Logic – Gordon - 1988 |
| 164 | Network Security: Private Communication in a Public World – Kaufman, Perlman, et al. - 2002 |
| 150 | Privacy enhancement for Internet electronic mail: Part I | message encipherment and authentication procedures," Network Working Group Request for Comments RFC 1113 – Linn - 1989 |
| 83 | Privacy Enhancement for Internet Electronic Mail – Balenson - 1993 |
| 62 | Automating Recursive Type Definitions in Higher-Order Logic – Melham - 1989 |
| 5 | An Introduction to Higher Order Logic: To Truth through Proof – Andrews - 1986 |
| 1 | Formal Methods Applied to Secure Network Engineering – Chin, Faust, et al. |
| 1 | Multi-destination secure electronic mail – Mitchell - 1989 |
