|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 listsCOP15 explained what Copenhagen means for you Hitachi Cambridge Seminar Series Cambridge Talk-What Cambridge Wore-
Other talksMaking, breaking and directing polarity during neural lumen formation and neurogenesis in the zebrafish embryo Beyond genomes: new insights into the trypanosome-tsetse interactions Navigating through tissue mazes: how leukocytes find their way to functional destinations Mixing dynamics in pulsed fuel jets Fourth Rollo Davidson Lecture The lawfulness of the contingent