46 search results - page 1 / 10 » Computational Soundness of Formal Indistinguishability and S... |
ASIAN
2006
Springer
13 years 8 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
GRC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-graine...
CCS
2010
ACM
13 years 5 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...