Timeline for Generating a set of integer passwords that can be securely authenticated
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2012 at 22:29 | comment | added | Aaron Meyerowitz | I agree. Threshold schemes are not relevant to your problem although they are very cool en.wikipedia.org/wiki/Secret_sharing. A k=1 threshold scheme is like the front door on most homes. Several people have the same key, any k=1 can do everything. Not what you want. | |
| May 28, 2012 at 13:20 | comment | added | Vincent Tjeng | Hi Aaron, thanks for your suggestion regarding the function $S(x)$, I think it would nicely help to expand a solution for a single individual to multiple individuals in most cases. However, I've read up some of the literature on threshold schemes and am still not sure how the solutions are applicable to my problem. In this problem, only one person's password is required to know everything, so as @max mentioned it's the special case where k=1. Or am I missing something here. | |
| May 28, 2012 at 0:25 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |