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

New Message Reply About this list Date view Thread view Subject view Author view

bram (bram@gawth.com)
Tue, 5 Jan 1999 16:34:39 -0500


On Tue, 5 Jan 1999, Ryan Lackey wrote:

> "Without revealing more than a single bit of information to party A
> or party B (the set membership status of the item), is it possible to test
> if a 1024-bit string on A's personal computer is contained in a list stored
> on B's personal computer, in (preferably) a small number of network and
> compute steps or (failing that) a vaguely tractable/finite computation,
> not involving a TTP." The list on B's computer contains 10E6-10E9 elements.

If you want it to be impossible for B to tell what A's number is without
getting a match, then B must have to perform some operation on every
number in his list - otherwise he could glean information about A's number
based on his own usage patterns.

-Bram


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:01