Sciweavers

4217 search results - page 1 / 844
» Computational indistinguishability logic
Sort
View
CCS
2010
ACM
13 years 5 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
KR
2004
Springer
13 years 10 months ago
Intransitivity and Vagueness
There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be ...
Joseph Y. Halpern
CSFW
2005
IEEE
13 years 11 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
CADE
2009
Springer
14 years 6 months ago
Computing Knowledge in Security Protocols under Convergent Equational Theories
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
Stéphanie Delaune, Stefan Ciobâca, St...