|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 listsIn Situ Graduate Colloquium 2013 - Department of Architecture Cavendish Knowledge Exchange Working Lunch Series Cambridge Past, Present & Future
Other talksJewish Life in Poland Today Orthography, <ει>? Spellings in Papyri, Uncials, and Tyndale House’s *The New Testament in its Original Greek* Induced Subgraphs of Ramsey Graphs Finance and regional growth in Britain, 1870-1913 The Rise of Low Voltage Electron Microscopy for Quantum Materials Research Going Negative: The Legal, Institutional, and Political Case for Negative Interest Rates at the U.S. Federal Reserve