Show simple item record

dc.contributor.authorShafarenko, A.
dc.contributor.authorChristianson, B.
dc.date.accessioned2012-03-26T18:00:43Z
dc.date.available2012-03-26T18:00:43Z
dc.date.issued2011-01-01
dc.identifier.citationShafarenko , A & Christianson , B 2011 , Gearing up : How to eat your cryptocake and still have it . in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . vol. 7114 , pp. 258-259 , 19th International Security Protocols Workshop , Cambridge , United Kingdom , 28/03/11 . https://doi.org/10.1007/978-3-642-25867-1_24
dc.identifier.citationconference
dc.identifier.otherPURE: 668434
dc.identifier.otherPURE UUID: 576e8021-235c-4de4-9052-affde19b0af9
dc.identifier.otherScopus: 84855797285
dc.identifier.urihttp://hdl.handle.net/2299/8052
dc.description.abstractOften Alice and Bob share a fixed quantity of master key and subsequently need to agree a larger amount of session key material. At present, they are inclined to be cautious about generating too much session key material from a single master key. We argue that this caution arises from their familiarity with keys consisting of a few dozen bytes, and may be misplaced when keys consist of many billions of bytes. In particular, if the proof that the master key was securely distributed depends on a bounded-memory assumption for Moriarty, then the same assumption also imposes constraints upon the cryptanalysis which Moriarty can apply to the generated session material. Block ciphers with (effectively) Terabit blocks allow a much higher ratio of session to master key than can be countenanced with current key lengths, and we construct one such cypher.en
dc.format.extent2
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsOpen
dc.titleGearing up : How to eat your cryptocake and still have iten
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=84855797285&partnerID=8YFLogxK
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeFinal Accepted Version
dcterms.dateAccepted2011-01-01
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1007/978-3-642-25867-1_24
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record