Abstract
This talk has to do with big, or rather huge numbers of bits, and how it affects security. I’m going to start with the observation that shared keys are not always small. Very long keys can be shared using the so-called beacon method, which is well-known in various shapes and forms. The principle is always the same, you have a high rate source of random data, by random I mean as random as you can get. This is the single vulnerability point, the source of data, if you compromise it you compromise the whole system, but you can secure that physically, just don’t let Moriarty come anywhere near it, that’s all you need. The high rate data source creates and broadcasts an enormous amount of data, exabytes. Then there are customers of the system, Alice and Bob, maybe George as well, and Charlie. The method is not sensitive to how many customers there are.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shafarenko, A. (2011). Gearing Up: How to Eat Your Cryptocake and Still Have It (Transcript of Discussion). In: Christianson, B., Crispo, B., Malcolm, J., Stajano, F. (eds) Security Protocols XIX. Security Protocols 2011. Lecture Notes in Computer Science, vol 7114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25867-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-25867-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25866-4
Online ISBN: 978-3-642-25867-1
eBook Packages: Computer ScienceComputer Science (R0)