Please use this identifier to cite or link to this item:
|Title:||On compression of cryptographic keys|
|Citation:||Chan, A.C.-F. (2008). On compression of cryptographic keys. IEEE International Symposium on Information Theory - Proceedings : 1853-1857. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2008.4595309|
|Abstract:||Any secured system can be modeled as a capabilitybased access control system in which each user is given a set of secret keys of the resources he is granted access to. In some systems which are sensitive to key storage cost, key derivation is commonly used. With a goal to minimize the maximum key storage per user, key compression based on key linking, that is, deriving one key from another without compromising security, is studied. A lower bound on key storage needed for a general access structure with key derivation is derived. This bound demonstrates the theoretic limit of any systems which do not trade off security and can be treated as a negative result to provide ground for designs with security tradeoff. A concrete, provably secure key linking scheme based on pseudorandom functions is given, along with an algorithm for finding optimal key linking patterns. © 2008 IEEE.|
|Source Title:||IEEE International Symposium on Information Theory - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 24, 2018
WEB OF SCIENCETM
checked on May 16, 2018
checked on May 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.