239 search results - page 11 / 48 » Proof Techniques for Cryptographic Processes |
GECCO
1999
Springer
14 years 25 days ago
1999
Springer
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
ISW
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
WMCSA
2009
IEEE
14 years 3 months ago
2009
IEEE
There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to ei...
DBSEC
2007
13 years 10 months ago
2007
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
ACTA
2010
13 years 8 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...