CryptoDB
User-Sure-and-Safe Key Retrieval
Authors: | |
---|---|
Download: | |
Abstract: | In a key retrieval scheme, a human user interacts with a client computer to retrieve a key. A scheme is user-sure if any adversary without access to the the user cannot distinguish the retrieved key from a random key. A scheme is user-safe if any adversary without access to the client's keys, or simultaneous user and client access, cannot exploit the user to distinguish the retrieved key from a random key. A multiple-round key retrieval scheme, where the user is given informative prompts to which the user responds, is proved to be user-sure and user-safe. Remote key retrieval involves a keyless client and a remote, keyed server. User-sure and user-safe are defined similarly for remote key retrieval. The scheme is user-anonymous if the server cannot identify the user. A remote version of the multiple-round key retrieval scheme is proved to be user-sure, user-safe and user-anonymous. |
BibTeX
@misc{eprint-2008-17867, title={User-Sure-and-Safe Key Retrieval}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / user security}, url={http://eprint.iacr.org/2008/190}, note={ dbrown@certicom.com 13997 received 28 Apr 2008}, author={Daniel R. L. Brown}, year=2008 }