University of Hertfordshire

By the same authors

Gearing up: How to eat your cryptocake and still have it

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Standard

Gearing up : How to eat your cryptocake and still have it. / Shafarenko, A.; Christianson, B.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7114 2011. p. 258-259.

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Harvard

Shafarenko, 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

APA

Shafarenko, 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) https://doi.org/10.1007/978-3-642-25867-1_24

Vancouver

Shafarenko A, Christianson B. 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. 2011. p. 258-259 https://doi.org/10.1007/978-3-642-25867-1_24

Author

Shafarenko, A. ; Christianson, B. / Gearing up : How to eat your cryptocake and still have it. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7114 2011. pp. 258-259

Bibtex

@inbook{576e8021235c4de49052affde19b0af9,
title = "Gearing up: How to eat your cryptocake and still have it",
abstract = "Often 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.",
author = "A. Shafarenko and B. Christianson",
year = "2011",
month = "1",
day = "1",
doi = "10.1007/978-3-642-25867-1_24",
language = "English",
volume = "7114",
pages = "258--259",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

RIS

TY - CHAP

T1 - Gearing up

T2 - How to eat your cryptocake and still have it

AU - Shafarenko, A.

AU - Christianson, B.

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Often 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.

AB - Often 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.

UR - http://www.scopus.com/inward/record.url?scp=84855797285&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25867-1_24

DO - 10.1007/978-3-642-25867-1_24

M3 - Other chapter contribution

VL - 7114

SP - 258

EP - 259

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -