Sciweavers

1528 search results - page 38 / 306
» On Signatures for Communication Graphs
Sort
View
DAC
2002
ACM
14 years 8 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...
GLOBECOM
2010
IEEE
13 years 5 months ago
Range-Key Extension of the Skip Graph
In the Skip Graph, which is a structured overlay network that supports range retrievals, a key is supposed to consist of a single value. Therefore, the Skip Graph cannot perform ra...
Yoshimasa Ishi, Yuuichi Teranishi, Mikio Yoshida, ...
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
JUCS
2010
124views more  JUCS 2010»
13 years 6 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
JALC
2006
87views more  JALC 2006»
13 years 7 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...