Encryption Sticks (Randomats)

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2229)


Recognizing that a trusted, highly random, series of bits is the currency of modern cryptography, one may opt for a physical contraption that houses a supply of random bits, ready for safe and versatile use by individuals and organizations. Usage ranges from a steady supply of random keys to the prevailing symmetric and stream cryptographies, and up to raw one-time-pad protocols. The contraption dubbed encryption stick, e-stick, or Randomat enables one to establish a virtual identity which is highly secure against exposure, and thus empowers people towards candid exchange, anonymous transactions, and wholesale transparency of issues, with potentially broad social implications. The e-stick will be cash purchased in a public shop (anonymity), and this off-Internet item will protect its user from the pervasive data nakedness in cyberspace.


Block Cipher Stream Cipher Encrypt Message Tennis Racket Virtual Identity 
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.


  1. 1.
    G. Vernam, “The Vernam Cipher” US Patent No 1,310,719.Google Scholar
  2. 2.
    M. Roe “Cryptography and Evidence” Doct. Dissert., Univ of Cambridge, UK, 1997.Google Scholar
  3. 3.
    C. E. Shannon “A Mathematical Theory of Cryptography” Technical Report 45-110-92, Bell Laboratories, 1945.Google Scholar
  4. 4.
    C. E. Shannon “Communication Theory of Secrecy Systems”, Bell Systems Tech. Jr. Vol 28, pages 656–715, 1949.MathSciNetGoogle Scholar
  5. 5.
    G. Samid, “Daniel Encryption: Description and Specifications” AGS Encryptions, Ltd, Tel-Aviv, Israel, 2000.Google Scholar
  6. 6.
    Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone “Handbook of Applied Cryptography” CRC Press 1997.Google Scholar
  7. 7.
    R. Canetti, R. Gennaro, “Incoercible Multiparty Computation”, FOCS’96.Google Scholar
  8. 8.
    D. Beaver: “Plausible Deniability (extended abstract)”; Pragocrypt’ 96 Proceedings, 1996.Google Scholar
  9. 9.
    Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky “Deniable Encryption” Crypto’97.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  1. 1.Technion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations