4485 search results - page 45 / 897 » Equivalences on Observable Processes |
CCS
2011
ACM
12 years 8 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
ARESEC
2011
12 years 8 months ago
2011
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
EUSFLAT
2009
13 years 6 months ago
2009
Connectivity analysis methodology is suitable to find representative symptoms of a disease. This methodology describes connections between symptoms in particular way and then choos...
FUIN
2007
13 years 8 months ago
2007
A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts. It is based on a timed process algebra and on a...
ICST
2009
IEEE
13 years 6 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...