Gearing Up: How to Eat Your Cryptocake and Still Have It (Transcript of Discussion)

  • Alex Shafarenko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7114)


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.


Shared Secret Quantum Cryptography Normal Optical Transmission Quantum Cryptography System Tolerate Error Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alex Shafarenko
    • 1
  1. 1.University of HertfordshireHatfieldUK

Personalised recommendations