4217 search results - page 5 / 844 » Computational indistinguishability logic |
LOGCOM
2010
13 years 5 months ago
2010
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ļ...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We propose a novel algorithm of counting indistinguishable objects by a collection of sensors. The information on multiple counting is recovered from the stochastic correlation pat...
CSFW
2012
IEEE
11 years 9 months ago
2012
IEEE
āIn this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We deļ¬ne a general model for domain extenders and prov...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...