sacred-4----Page:3
1 2 3 4 5 6 7 8 9
|
Outline of Protocol* Uses an application of oblivious transfer Faster than previous uses Server constructs a database mapping from the password to a table of primes Also a complementary mapping Server constructs a group G with generator g having the following properties for each p in the prime mapping, but no prime p’ in the complementary mapping. Either: The computation of x mod p from g and h = gx has a unique answer or: h 1/p has a unique answer Server sends group to client Client uses group to generate “challenges” to the server that allow the server to demonstrate it knows the password “Challenges” based on solutions to the two problems Key is generated as a hash of database entries *at the level I understand it now |