[Cryptography] Secret Handshake problem.
Ben Laurie
ben at links.org
Sun Mar 12 08:33:35 EDT 2017
On 6 March 2017 at 00:17, Peter Gutmann <pgut001 at cs.auckland.ac.nz> wrote:
> Finally, the checking mechanism should be done in a manner that makes
> enumeration ("which of these car license places in the parliamentary car park
> is on a blacklist of people who abuse sex workers?") difficult.
This seems impossible - you'd just check each plate in the car park,
making it O(n) at worst.
But the normal meaning of enumeration ("give me a list of abusive
plates") should be hard.
More information about the cryptography
mailing list