Re: [Math] Exists "Zero-knowledge test for set membership"?

Giff (giff@eng.us.uu.net)
Tue, 5 Jan 1999 17:52:16 -0500 (EST)

• Next message: Anonymous: "Re: [Math] Exists "Zero-knowledge test for set membership"?"
• Previous message: Steve Bellovin: "Re: [Math] Exists "Zero-knowledge test for set membership"?"
• Maybe in reply to: Ryan Lackey: "[Math] Exists "Zero-knowledge test for set membership"?"
• Next in thread: bram: "Re: [Math] Exists "Zero-knowledge test for set membership"?"

On Tue, 5 Jan 1999, Anonymous wrote:

> If A's numbers are unguessable, as being 1024 bits suggests, can he just
> send a hash of his number to B, and have B tell him whether the number is
> in the list (by comparing to the hashes of list items)?

No, because then B knows the number in question, since he calculates the
hash for each of his numbers until he finds a match.

• Next message: Anonymous: "Re: [Math] Exists "Zero-knowledge test for set membership"?"
• Previous message: Steve Bellovin: "Re: [Math] Exists "Zero-knowledge test for set membership"?"
• Maybe in reply to: Ryan Lackey: "[Math] Exists "Zero-knowledge test for set membership"?"
• Next in thread: bram: "Re: [Math] Exists "Zero-knowledge test for set membership"?"