Summary II
Showed how to achieve Resttable ID schemes
Which are secure even
- When adversary can reset the internal state and/or randomization source of the user identifying itself, and
- If executed in an asynchronous environment like the Internet.
- Useful for small portable devices (smart-cards)
- When prover has a only a short random input
-
Future Directions:
- New definitions of POK which break paradox.
- Show how to achieve them for NP