[8905] in cryptography@c2.net mail archive
Re: Zero Knowledge Identity Proofs
daemon@ATHENA.MIT.EDU (Helger Lipmaa)
Mon Jun 25 11:28:33 2001
Date: Mon, 25 Jun 2001 10:28:39 +0300 (EET DST)
From: Helger Lipmaa <helger@tml.hut.fi>
To: Michael Conlen <meconlen@obfuscated.net>
Cc: <cryptography@wasabisystems.com>
In-Reply-To: <NFBBJNNKKLIPPJPMCEAPIEGBEMAA.meconlen@obfuscated.net>
Message-ID: <Pine.GSO.4.33.0106251025460.11264-100000@morphine.tml.hut.fi>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
On Sun, 24 Jun 2001, Michael Conlen wrote:
> I'm reading about zero knowledge identity proofs and 'The Mafia Fraud' in
> Applied Cryptography. Has no one found a way to perform an identity proof
> such that you can prove who you are to a specific person? In the example in
> the book Alice proves who she is to Bob who transmits to Carol, and Carol
> proves that she is Alice to Dave. I'm curious what the problem is with
> creating a proof that Alice is Alice such that only Bob can be assured that
> she is Alice so that Carol can't use the proof to identify who she is to
> Dave.
THe proofs that you are requesting for have been standard tools in
cryptography for many years - they are usually known as identification
schemes. The best known scheme (and most elegant IMHO) is the Schnorr
identification scheme. See
http://www.tml.hut.fi/~helger/crypto/link/identification/
for a (noncomplete) collection of links.
Helger
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
