Insider threats for auctions: formalization, mechanized proof, and code generation

Kammueller, Florian, Kerber, Manfred and Probst, Christian (2017) Insider threats for auctions: formalization, mechanized proof, and code generation. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA), 8 (1). pp. 44-78. ISSN 2093-5374 (doi:10.22667/JOWUA.2017.03.31.044)

[img]
Preview
PDF - Published version (with publisher's formatting)
Download (9MB) | Preview

Abstract

This paper applies machine assisted formal methods to explore insider threats for auctions. Auction systems, like eBay, are an important problem domain for formal analysis because they challenge modelling concepts as well as analysis methods. We use machine assisted formal modelling and proof in Isabelle to demonstrate how security and privacy goals of auction protocols can be formally verified. Applying the costly scrutiny of formal methods is justified for auctions since privacy and trust are prominent issues and auctions are sometimes designed for one-off occasions where high bids are at stake. For example, when radio wave frequencies are on sale, auctions are especially created for just one occasion where fair and consistent behaviour is required. Investigating the threats in auctions and insider collusions, we model and analyze auction protocols for insider threats using the interactive theorem prover Isabelle. We use the existing example of a fictitious cocaine auction protocol from the literature to develop and illustrate our approach. Combining the Isabelle Insider framework with the inductive approach to verifying security protocols in Isabelle, we formalize the cocaine auction protocol, prove that this formal definition excludes sweetheart deals, and also that collusion attacks cannot generally be excluded. The practical implication of the formalization is demonstrated by code generation. Isabelle allows generating code from constructive specifications into the programming language Scala. We provide constructive test functions for cocaine auction traces, prove within Isabelle that these functions conform to the protocol definition, and apply code generation to produce an implementation of the executable test predicate for cocaine auction traces in Scala.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 21970
Notes on copyright: Full text reproduced with permission of JoWUA
Useful Links:
Depositing User: Florian Kammueller
Date Deposited: 13 Jun 2017 09:24
Last Modified: 05 Apr 2019 12:12
URI: https://eprints.mdx.ac.uk/id/eprint/21970

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year