Proving Possession of Arbitrary Secrets While not Giving them Away: New Protocols and a Proof in GNY Logic

Synthese 149 (2):409-443 (2006)
  Copy   BIBTEX

Abstract

This paper introduces and describes new protocols for proving knowledge of secrets without giving them away: if the verifier does not know the secret, he does not learn it. This can all be done while only using one-way hash functions. If also the use of encryption is allowed, these goals can be reached in a more efficient way. We extend and use the GNY authentication logic to prove correctness of these protocols

Categories

Keywords

Reprint years

DOI

10.1007/s11229-005-3879-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

About Goodmanʼs Theorem.Thierry Coquand - 2013 - Annals of Pure and Applied Logic 164 (4):437-442.
Teaching proving by coordinating aspects of proofs with students' abilities.Annie Selden & John Selden - 2009 - In Despina A. Stylianou, Maria L. Blanton & Eric J. Knuth (eds.), Teaching and learning proof across the grades: a K-16 perspective. New York: Routledge. pp. 339--354.
Kant on Proving Aristotle’s Logic as Complete.Huaping Lu-Adler - 2016 - Kantian Review 21 (1):1-26.
Proof complexity of propositional default logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
Relating protocols for dynamic dispute with logics for defeasible argumentation.Henry Prakken - 2001 - Synthese 127 (1-2):187-219.
The Web as A Tool For Proving.Petros Stefaneas & Ioannis M. Vandoulakis - 2012 - Metaphilosophy 43 (4):480-498.
Logic of secrets in collaboration networks.Sara Miner More & Pavel Naumov - 2011 - Annals of Pure and Applied Logic 162 (12):959-969.
Proof and refutation in MALL as a game.Olivier Delande, Dale Miller & Alexis Saurin - 2010 - Annals of Pure and Applied Logic 161 (5):654-672.
Finite Models of Some Substructural Logics.Wojciech Buszkowski - 2002 - Mathematical Logic Quarterly 48 (1):63-72.
Isabelle/Hol a Proof Assistant for Higher-Order Logic.Tobias Nipkow, Lawrence C. Paulson & Markus Wenzel - 2002 - Berlin and New York: Springer.
Sources of Delusion in Analytica Posteriora 1.5.Pieter Sjoerd Hasper - 2006 - Phronesis 51 (3):252 - 284.
A logic for extensional protocols.Ben Rodenhäuser - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):477-502.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.
Middle-Out Reasoning for Logic Program Synthesis.Ina Kraan, David A. Basin & Alan Bundy - 1993 - Department of Artificial Intelligence, University of Edinburgh.

Analytics

Added to PP
2009-01-28

Downloads
51 (#317,811)

6 months
3 (#1,020,910)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Learning to apply theory of mind.Rineke Verbrugge & Lisette Mol - 2008 - Journal of Logic, Language and Information 17 (4):489-511.

Add more citations

References found in this work

The Russian cards problem.Hans van Ditmarsch - 2003 - Studia Logica 75 (1):31-62.

Add more references