Calculus of cooperation and game-based reasoning about protocol privacy

From MaRDI portal

Revision as of 20:16, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2946671

Jump to:navigation, search

DOI10.1145/2287718.2287722zbMath1351.68168OpenAlexW2094647900MaRDI QIDQ2946671

Pavel Naumov, Sara Miner More

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2287718.2287722

zbMATH Keywords

formal verification privacy intuitionistic logic games multiparty computation

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items (4)

Together we know how to achieve: an epistemic logic of know-how ⋮ Unnamed Item ⋮ Knowing-how under uncertainty ⋮ On composition of bounded-recall plans

This page was built for publication: Calculus of cooperation and game-based reasoning about protocol privacy

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2946671&oldid=15938362"