Journal
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Volume 13, Issue 3, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2287718.2287722
Keywords
Theory; Verification; Security; intuitionistic logic; games; multiparty computation; privacy; formal verification
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available