Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Vernam, “The Vernam Cipher” US Patent No 1,310,719.
M. Roe “Cryptography and Evidence” Doct. Dissert., Univ of Cambridge, UK, 1997.
C. E. Shannon “A Mathematical Theory of Cryptography” Technical Report 45-110-92, Bell Laboratories, 1945.
C. E. Shannon “Communication Theory of Secrecy Systems”, Bell Systems Tech. Jr. Vol 28, pages 656–715, 1949.
G. Samid, “Daniel Encryption: Description and Specifications” AGS Encryptions, Ltd, Tel-Aviv, Israel, 2000.
Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone “Handbook of Applied Cryptography” CRC Press 1997.
R. Canetti, R. Gennaro, “Incoercible Multiparty Computation”, FOCS’96.
D. Beaver: “Plausible Deniability (extended abstract)”; Pragocrypt’ 96 Proceedings, 1996.
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky “Deniable Encryption” Crypto’97.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samid, G. (2001). Encryption Sticks (Randomats). In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-45600-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42880-0
Online ISBN: 978-3-540-45600-1
eBook Packages: Springer Book Archive