|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 listsAMOP Quantum Journal Club EPRG Energy and Environment Seminar Series Exploring modern South Asian history with visual research methods: theories and practices
Other talksFour arguments against the reaction-diffusion master equation (and one in its favour). The cutting edge of Alzheimer’s disease research Cancer: Finding New Targets and Novel Therapies The granularity of social action ascription in conversational interaction Multi-sensor geophysical constraints on crustal melt in the central Andes at a so-called zombie volcano: the PLUTONS project Moving Forward with Stem Cell Therapy