Repository | Journal | Volume | Articles
(2006) Synthese 149 (2).
Proving possession of arbitrary secrets while not giving them away
new protocols and a proof in gny logic
Wouter Teepe
pp. 409-443
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.
Publication details
DOI: 10.1007/s11229-005-3879-4
Full citation:
Teepe, W. (2006). Proving possession of arbitrary secrets while not giving them away: new protocols and a proof in gny logic. Synthese 149 (2), pp. 409-443.
This document is unfortunately not available for download at the moment.