Repository | Journal | Volume | Article
Proving possession of arbitrary secrets while not giving them away
new protocols and a proof in gny logic
pp. 409-443
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.
Publication details
Published in:
(2006) Synthese 149 (2).
Pages: 409-443
DOI: 10.1007/s11229-005-3879-4
Full citation:
Teepe Wouter (2006) „Proving possession of arbitrary secrets while not giving them away: new protocols and a proof in gny logic“. Synthese 149 (2), 409–443.