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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Proving Correctness of Secret Sharing Protocols using the Inductive Method

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Palmerston Room, Fisher Building, St John's College, St John’s Street, CB2 1TP Centre for Mathematical Sciences, MR12 Pfizer Lecture Theatre, Department of Chemistry, Lensfield Road

Other talks

Security Cooperation within Government and between Governments The search for a new population of strong gravitational lenses with JWST Seminars in Cancer Paediatric Medicine and Rheumatology Christopher Cowie on the epistemology of assessing biosignature claims Content, Caching and Kubernetes: Performance and User Experience in the Browser
 

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