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

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

Anonymous (nobody@replay.com)
Tue, 5 Jan 1999 23:21:38 +0100


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)?


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