4217 search results - page 3 / 844 » Computational indistinguishability logic |
FOSSACS
2005
Springer
14 years 28 days ago
2005
Springer
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...
IGPL
2007
13 years 7 months ago
2007
Quasi-set theory is a theory for dealing with collections of indistinguishable objects. In this paper we discuss some logical and philosophical questions involved with such a theo...
IMA
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
GRC
2007
IEEE
14 years 1 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...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...