University of Cambridge > Talks.cam > Computer Laboratory Security Seminar > Towards interactive belief, knowledge, and provability: possible application to zero-knowledge proofs

Towards interactive belief, knowledge, and provability: possible application to zero-knowledge proofs

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

If you have a question about this talk, please contact Andrew Lewis.

We argue that modal operators of interactive belief, knowledge, and provability are definable as natural generalisations of their non-interactive counterparts, and that zero-knowledge proofs (from cryptography) have a natural (modal) formulation in terms of interactive individual knowledge, non-interactive propositional knowledge and interactive provability. Our work is motivated by van Benthem’s investigation into rational agency and dialogue and our attempt to redefine modern cryptography in terms of modal logic.

This ongoing work builds on Chapter 5 of my thesis Logical Concepts in Cryptography http://library.epfl.ch/en/theses/?nr=3845

This talk is part of the Computer Laboratory Security Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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