Proving possession of arbitrary secrets while not giving them away

new protocols and a proof in gny logic

Wouter Teepe

pp. 409-443

in: Synthese 149 (2), 2006.

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.