The University of Southampton
University of Southampton Institutional Repository

Calculus of cooperation and game-based reasoning about protocol privacy

Calculus of cooperation and game-based reasoning about protocol privacy
Calculus of cooperation and game-based reasoning about protocol privacy
The article introduces a new formal system, the calculus of cooperation, for reasoning about coalitions of players in a certain class of games. The calculus is an extension of the propositional intuitionistic logic that adds a coalition parameter to intuitionistic implication. The system is shown to be sound and complete with respect to a game semantics. One intended application of the calculus of cooperation is the verification of privacy properties in multiparty computation protocols. The article argues that such properties can be established by providing a set of strategies for a non-zero-sum, perfect information game based on the protocol. It concludes with several examples of such verifications formalized in the calculus of cooperation.
Formal Verification, Games, Intuitionistic logic, Multiparty computation, Privacy
1529-3785
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0

More, Sara Miner and Naumov, Pavel (2012) Calculus of cooperation and game-based reasoning about protocol privacy. ACM Transactions on Computational Logic, 13 (3), [22]. (doi:10.1145/2287718.2287722).

Record type: Article

Abstract

The article introduces a new formal system, the calculus of cooperation, for reasoning about coalitions of players in a certain class of games. The calculus is an extension of the propositional intuitionistic logic that adds a coalition parameter to intuitionistic implication. The system is shown to be sound and complete with respect to a game semantics. One intended application of the calculus of cooperation is the verification of privacy properties in multiparty computation protocols. The article argues that such properties can be established by providing a set of strategies for a non-zero-sum, perfect information game based on the protocol. It concludes with several examples of such verifications formalized in the calculus of cooperation.

This record has no associated files available for download.

More information

Published date: 28 August 2012
Keywords: Formal Verification, Games, Intuitionistic logic, Multiparty computation, Privacy

Identifiers

Local EPrints ID: 475896
URI: http://eprints.soton.ac.uk/id/eprint/475896
ISSN: 1529-3785
PURE UUID: bbf9a033-dddf-42b7-b3c7-159a70ca4127
ORCID for Pavel Naumov: ORCID iD orcid.org/0000-0003-1687-045X

Catalogue record

Date deposited: 30 Mar 2023 16:31
Last modified: 06 Jun 2024 02:12

Export record

Altmetrics

Contributors

Author: Sara Miner More
Author: Pavel Naumov ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×