Sciweavers

1528 search results - page 52 / 306
» On Signatures for Communication Graphs
Sort
View
CONCUR
1997
Springer
13 years 11 months ago
Bounded Stacks, Bags and Queues
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
Jos C. M. Baeten, Jan A. Bergstra
ICICS
1997
Springer
13 years 11 months ago
A new and optimal chosen-message attack on RSA-type cryptosystems
Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Qui...
MOBISYS
2008
ACM
14 years 7 months ago
Detecting energy-greedy anomalies and mobile malware variants
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
Hahnsang Kim, Joshua Smith, Kang G. Shin
ANCS
2007
ACM
13 years 11 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 2 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...