4217 search results - page 4 / 844 » Computational indistinguishability logic |
ICITS
2009
13 years 5 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
AIML
2008
13 years 8 months ago
2008
In this paper we study the intermediate logic MLO(X) of open subsets of a metric space X. This logic is closely related to Medvedev's logic of finite problems ML. We prove sev...
CCS
2008
ACM
13 years 9 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...
FOSSACS
2006
Springer
13 years 11 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...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...