University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Proving Correctness of Secret Sharing Protocols using the Inductive Method

Proving Correctness of Secret Sharing Protocols using the Inductive Method

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

Speaker: Jean Martina

A brief presentation of HOL in cryptographic protocols context, Inductive method, secret sharing, problems on (secret sharing) protocols, modelling and strategy.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity