Sciweavers

73 search results - page 12 / 15
» Deciding Properties of Contract-Signing Protocols
Sort
View
FOSSACS
2001
Springer
14 years 2 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
ICICS
2004
Springer
14 years 3 months ago
Robust Metering Schemes for General Access Structures
In order to decide on advertisement fees for web servers, Naor and Pinkas introduced (threshold) metering schemes secure against coalitions of corrupt servers and clients. They sho...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 11 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ICDCS
2009
IEEE
14 years 7 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu
FROCOS
2007
Springer
14 years 4 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...