Sciweavers

207 search results - page 11 / 42
» Proof Systems and Transformation Games
Sort
View
SEFM
2007
IEEE
15 years 3 months ago
Verifying Security Properties of Cryptoprotocols: A Novel Approach
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
Mohamed Saleh, Mourad Debbabi
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
15 years 3 months ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...
CSFW
2009
IEEE
15 years 4 months ago
Achieving Security Despite Compromise Using Zero-knowledge
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
Michael Backes, Martin P. Grochulla, Catalin Hritc...
CADE
2006
Springer
15 years 10 months ago
Automating Proofs in Category Theory
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
Dexter Kozen, Christoph Kreitz, Eva Richter
SAC
2008
ACM
14 years 9 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...