Chess grandmaster problem of zero knowledge proof of identity
From: Vladimir Shabanov (virl_at_mail.ru)
Date: 01/31/05
- Next message: Tom Linden: "Re: [Lit.] Buffer overruns"
- Previous message: Tom Linden: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 31 Jan 2005 07:06:33 -0800
Greetings!
I'm exploring of using zero knowledge proofs for identification.
There is so-called "grandmaster problem" (when Carol with help of Bob
can identify herself as Alice in Dave's shop; or when bad authentication
server can authenticate itself as your on third-side during your
authentication on it).
Bruce Schneier in his book "Applied Cryptography" in chapter 5.2 mentions
two solutions of this problem: "Faraday box" (when "auth. server" is
limited in communications to third parties) and using of clock (when "auth.
server" is limited in response time).
Do you know any other solutions of this problem?
I am trying to solve this problem and seeking for already
present solutions (because I don't want to reinvent a bicycle).
Best regards,
Vladimir Shabanov mailto:virl@mail.ru
P.S. Sorry for my English. It is not my native language.
- Next message: Tom Linden: "Re: [Lit.] Buffer overruns"
- Previous message: Tom Linden: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
