Sciweavers

449 search results - page 36 / 90
» Formal Modeling of Communication Protocols by Graph Transfor...
Sort
View
FC
2007
Springer
148views Cryptology» more  FC 2007»
15 years 7 months ago
A Model of Onion Routing with Provable Anonymity
Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its a...
Joan Feigenbaum, Aaron Johnson, Paul F. Syverson
FASE
2003
Springer
15 years 6 months ago
Model-Based Development of Web Applications Using Graphical Reaction Rules
Abstract. The OMG’s Model-Driven Architecture focusses on the evolution and integration of applications across heterogeneous middleware platforms. Presently available instances o...
Reiko Heckel, Marc Lohmann
206
Voted
SPAA
2012
ACM
13 years 3 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
IFIP
2009
Springer
15 years 8 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
APN
1994
Springer
15 years 5 months ago
Coloured Petri Nets Extended with Channels for Synchronous Communication
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are...
Søren Christensen, Niels Damgaard Hansen