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

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

Contagion and Containment Dominic Sandbrook: 'State of Emergency: Britain in the 1970s' EPRG Energy and Environment (E&E) Series Michaelmas 2011

Other talks

The formation of high density dust rings and clumps: the role of vorticity Protean geographies: Plants, politics and postcolonialism in South Africa Bayesian optimal design for Gaussian process model Active Subspace Techniques to Construct Surrogate Models for Complex Physical and Biological Models Bank credit rating changes, capital structure adjustments and lending The ‘Easy’ and ‘Hard’ Problems of Consciousness Microtubule Modulation of Myocyte Mechanics Sustainability of livestock production: water, welfare and woodland Unbiased Estimation of the Eigenvalues of Large Implicit Matrices Symplectic topology of K3 surfaces via mirror symmetry TBC
 

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