Calculus of cooperation and game-based reasoning about protocol privacy

ACM Trans. Comput. Log.(2012)

引用 12|浏览10
暂无评分
摘要
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.
更多
查看译文
关键词
propositional intuitionistic logic,perfect information game,new formal system,protocol privacy,coalition parameter,game-based reasoning,intended application,certain class,game semantics,privacy property,multiparty computation protocol,games,privacy,formal verification,intuitionistic logic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要