|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Towards interactive belief, knowledge, and provability: possible application to zero-knowledge proofs
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.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsConspiracy & Democracy Cavendish HEP Seminars 2d to 3d equation sets and implication of super massive blackholes
Other talksThe Science of Pain and its Management 2016 The Challenges of Engaging with Childhood under the Nazi Regime (tbc) Structure, Biology and Therapeutic Potential of Novel ER Located Growth Factors Is the crystallisation of pharmaceutical molecules controlled by thermodynamics or kinetics? tbc The CRISPR-Cas bacterial adaptive immune systems