University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > How provably secure are cryptographic primitives used in practice

How provably secure are cryptographic primitives used in practice

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

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

We will discuss how ‘provably secure’ are several cryptographic primitives of practical relevance. Examples include OAEP encryption and Full Domain Hash Signatures.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

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