Multi-party computation forever, for cloud computing and beyond.
Shlomi Dolev
07 July 2011, 10h30 - 07 July 2011, 12h00 Salle/Bat : 455/PCRI-N
Contact :
Activités de recherche :
Résumé :
Three works will be described. In the first we present reactive secret sharing, that changes the secret according to unbounded sequence of common inputs, where no communication among the (dynamic set of) participants is allowed, we present a fully secure solution for simple functions but somewhat non secure solution for any function.. In the second work dynamic on-going multiparty computation, in which we consider the case of dynamic group of participants that should not know the sequence of inputs of the others, as well as should not know the function performed on the inputs. In the last work we consider the case of infinite execution with no communication among the participants where we prove that any automaton can be executed in a fully secure fashion, the construction is based on Krohn-Rhodes decomposition technique.
