Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2008.4595309
DC FieldValue
dc.titleOn compression of cryptographic keys
dc.contributor.authorChan, A.C.-F.
dc.date.accessioned2013-07-04T08:43:08Z
dc.date.available2013-07-04T08:43:08Z
dc.date.issued2008
dc.identifier.citationChan, 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
dc.identifier.isbn9781424422579
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42091
dc.description.abstractAny 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2008.4595309
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/ISIT.2008.4595309
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page1853-1857
dc.description.codenPISTF
dc.identifier.isiut000260364401092
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.