|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 listsEnvironment on the Edge Lecture Series Cambridge Union Society - Debates and Speakers Cambridge Analysts' Knowledge Exchange (C.A.K.E.)
Other talks"Gas! GAS! Quick, boys!" How Chemistry Changed the First World War Provision of effective mental health services to sexual and gender minorities – Results from a systematic review of the literature (1980 – 2013 Bollywood Dance Workout I spy with my MRI.... Social Cognition in adolescent social networks Stable Poisson-Kingman species sampling priors generated by general ordered size biased generalized gamma mixing distributions