Jean Martina: "Proving Correctness of
Secret Sharing Protocols using the
Abstract. A brief presentation of HOL in cryptographic protocols
context, Inductive Method, secret sharing algorithms, problems
on (secret sharing) protocols, modelling and strategy.
Dario Fiore: "Off-line/On-line
Signatures: Theoretical aspects and Experimental Results".
Abstract. The goal of Off-line/On-line Signatures schemes is to reduce
the time used to compute a signature using some kind of preprocessing.
They were introduced by Even, Goldreich and Micali and constructed by
combining regular digital signatures with efficient one-time
signatures. Later Shamir and Tauman presented an alternative
construction (which produces shorter signatures) by combining regular
signatures with chameleon hash functions. A recent result by Catalano
et al. unifies the Shamir-Tauman and Even et al. approaches by showing
that they can be considered different
instantiations of the same paradigm. Moreover they ran experimental
tests to test the difference between the two approaches. Interestingly
such tests shows that the two approaches are comparable in efficiency
and signature length.
Gianpiero Costantino: "Power-Saving in
a Mobile Ad Hoc Network".
Abstract. The use of small portables and mobile phones has made MANETs
(Mobile Ad Hoc Networks) very popular. A MANET is a network composed of
a group of mobile nodes. These are power-constrained devices and hence
work until their batteries are not over. It is therefore important to
maximize the lifetime of a network of such nodes with methods that
allow power-saving. It is shown that a change in the existing E-DSR
(Energy-Dynamic Source Routing) protocol with “Contributo” formula
enhances the life of a node. It is also advocated that the embedding of
TPM (Trusted Platform Mobile) chipsets in the portables can strengthen
Francesco Librizzi: "Privacy
Preserving Protocols in electronic-Polls".
Abstract. With the power of the recent Internet technologies and
related research advances, some governments are considering a switch
from the conventional voting system to electronic voting systems.
E-voting is in turn a particular kind of electronic poll. But these
systems embed by their own nature a variety of security problems such
as authentication, secrecy, privacy and so on. This talk introduces a
protocol that belongs to the Self Enforcing Protocols group. The
protocol chiefly aims at preserving the privacy of the individuals who
submit their data to a pollster. The talk continues by advancing an
unpublished improvement to the protocol, and by introducing the Trusted
Computing scenario. A possible application of Trusted Computing
concepts to the e-voting problem with the aim of preserving the vote
anonymity is then sketched.