Re: Is this simple scheme secure?
From: Foo Bar (foobar965_at_hotmail.com)
Date: 01/30/04
- Next message: Cristiano: "Re: FFT test with few kbits"
- Previous message: Tarapia Tapioco: "Re: LEN SASSAMAN: WHERE DID YOU LEARN HOW TO LIE WITH SUCH A BALD FACE"
- In reply to: NYC: "Re: Is this simple scheme secure?"
- Next in thread: Gregory G Rose: "Re: Is this simple scheme secure?"
- Reply: Gregory G Rose: "Re: Is this simple scheme secure?"
- Reply: Tim Smith: "Re: Is this simple scheme secure?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 30 Jan 2004 21:27:50 GMT
NYC <name@company.com> writes:
> Foo Bar wrote:
<SNIP>
> > Zero-knowledge proofs can be used in cases where only one party knows
> > the secret and wants to prove that to another party, without revealing
> > any information regarding the secret. Your scheme relies on the fact
> > that both parties know the secret.
>
> Ok, but that can only be possible for some very specific kinds of
> secrets right?
It can be used for things like "I know a n-coloring of this graph" or "I
know an isomorphism between these two graphs". I don't know the area
well enough to comment on the case of more general secrets.
/FB
-- Foo Bar (foobar965@hotmail.com)
- Next message: Cristiano: "Re: FFT test with few kbits"
- Previous message: Tarapia Tapioco: "Re: LEN SASSAMAN: WHERE DID YOU LEARN HOW TO LIE WITH SUCH A BALD FACE"
- In reply to: NYC: "Re: Is this simple scheme secure?"
- Next in thread: Gregory G Rose: "Re: Is this simple scheme secure?"
- Reply: Gregory G Rose: "Re: Is this simple scheme secure?"
- Reply: Tim Smith: "Re: Is this simple scheme secure?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
