We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
We present a hybrid group key management protocol that incorporates both a centralized and a contributory scheme for key management, and a tree-based Elliptic Curve Diffie-Hellman...
We consider the problem of automatically extracting general lists from the web. Existing approaches are mostly dependent upon either the underlying HTML markup or the visual struc...
Fabio Fumarola, Tim Weninger, Rick Barber, Donato ...
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert
Abstract. Ontologies play a relevant role to support service matchmaking in the discovery process. In fact, the elements used for service capability description refer to concepts t...
Devis Bianchini, Valeria De Antonellis, Michele Me...