|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 listsNewnham College Speaker Series CaMedia (Media and Creative Industries Society) Computer Laboratory Opera Group Seminars
Other talksSt Catharine’s Political Economy Seminar – ‘‘Beyond Austerity and Stimulus: Broadening Capital Acquisition with the Earnings of Capital as a Means to Sustainable Fuller Employment and Growth’ Robert Ashford Observing Quasars that Switch Off. And back On again: What we are learning, and still don't understand, about the active central engines. AITKEN PUBLIC LECTURE - Shaken but not stirred: using mathematics in earthquakes Annual Conversazione: Cambridge’s oldest celebration of citizen science! The Art & Science of Clinical Problem-Solving Nelson Mandela: Romantic Hero, Tragic Hero Returning Mandela to Black History - Co-hosted with the Critical Theory and Practice Series