Show simple item record

dc.contributor.authorChristianson, B.
dc.contributor.authorMalcolm, J.
dc.date.accessioned2010-03-17T12:10:28Z
dc.date.available2010-03-17T12:10:28Z
dc.date.issued1998
dc.identifier.citationChristianson , B & Malcolm , J 1998 , ' Binding bit patterns to real world entities ' , Lecture Notes in Computer Science (LNCS) , vol. 1361 , pp. 105-113 . https://doi.org/10.1007/BFb0028163
dc.identifier.issn0302-9743
dc.identifier.otherdspace: 2299/4348
dc.identifier.otherORCID: /0000-0002-3777-7476/work/76728379
dc.identifier.urihttp://hdl.handle.net/2299/4348
dc.descriptionOriginal article can be found at: www.springerlink.com Copyright Springer.
dc.description.abstractPublic key cryptography is often used to verify the integrity of a piece of data, or more generally to ensure that operations which modify the data have been requested and carried out by principals who are authorized to do so. This requires keys to be bound to principals in an unforgetably verifiable manner. Cryptographic bit patterns such as electronic key certificates (EKCs) have a part to play in establishing such bindings, but the requirement ultimately to bind keys to real world entities imposes subtle constraints upon the structure and semantics of EKCs and related entities such as ACLs and capabilities, and upon the role which such entities may play in access control and integrity verification. These do not appear to be adequately realized at present.en
dc.format.extent939447
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science (LNCS)
dc.titleBinding bit patterns to real world entitiesen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
rioxxterms.versionofrecord10.1007/BFb0028163
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record