Abstract
The technology of mobile agents, where software pieces of active control and storage (called mobile agents) travel the network and perform tasks distributively, is of growing interest as an Internet technology. Similarly, smartcard holders can be considered mobile users as they access the network at various points. Such mobile processing can be employed in large scale census applications in statistics gathering, in surveys and tallying, in reading and collecting local control information, etc.
This distributed computing paradigm where local pieces of data are getting accumulated in a mobile unit presents new information security challenges. Here, we point at some problems it poses and suggest solutions. The basic problem considered involves the design of a mobile agent that is capable of traversing an untrusted (curious) network while gathering and securing data from the nodes that it visits. We assume that some subset of the nodes may collaborate to track the agent, and we assume that snapshots of memory are taken at each node at times that are unpredictable to the agent. The data that is gathered must be securely stored within the agent and the adversarial nodes must remain oblivious to what is taken by the agent. In addition, the agent’s movement throughout the network should be made difficult to trace. Furthermore, we assume that the agent is limited in storage capacity. To prevent the nodes from getting decryption capability, the agent must carry a public key for (asymmetric) encryption.
We present an economical solution that we call “sliding encryption≓. This is a new mode of operation of public key cryptosystems that allows the encryption of small amounts of plaintext yielding small amounts of ciphertext. Furthermore, the encryption is performed so that it is intractable to recover the plaintext without the appropriate private key. We also describe how to modify sliding encryption so that the resulting ciphertexts are hard to correlate, thus making it possible to have mobile agents that are not easy to trace. Sliding encryption is applicable to mobile agent technology and may have independent applications to “storage-limited technology≓ such as smartcards and mobile units.
Chapter PDF
Key words
References
M. Bellare, P. Rogaway, Optimal Asymmetrie Encryption, Eurocrypt 94.
D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. In Communications of the ACM, v. 24, n. 2, Feb 1981, pages 84–88.
F. Cheong. Internet Agents: Spiders, Wanderers, Brokers, and Bots. New Riders Publishing, page 5, 1996.
D. Denning. Cryptography and Data Security, Addison-Wesley, page 137, 1983.
T. ElGamal. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In Advances in Cryptology—CRYPTO ’84, Springer-Verlag, pages 10–18, 1985.
S. Goldwasser, A. Micali. Probabilistic Encryption. In Journal of Computer and Systems Science, v. 28, pages 270–299, 1984.
C. Gulcu, G. Tsudik. Mixing Email with BABEL. In Proceedings of the 1996 Symp. on Network and Distributed System Security ISOC, pages 2–16, 1996.
D. Mitchell, M. Blaze, truerand.c, AT&T Laboratories, 1995.
J. McAfee. Computer Viruses, Worms, Data Diddlers, Killer Programs, and other Threats to Your System. St. Martin’s Press, page 29, 1989.
R. Rivest, A. Shamir, L. Adleman. A method for obtaining Digital Signatures and Public-Key Cryptosystems. In Communications of the ACM, v. 21, n. 2, pages 120–126, 1978.
R. Slade. Robert Slade’s Guide to Computer Viruses. Springer-Verlag, page 49, 1994.
S.R. White, Covert Distributed Processing with Computer Viruses. In Proceedings of the Crypto 89, pages 616–619.
D. Wheeler, R. Needham. Tiny Encryption Algorithm (TEA). In Fast Software Encryption: second international workshop, volume 1008 of Lecture Notes in computer science, Dec. 1994. Springer.
A. Young, M. Yung. Cryptovirology: Extortion-Based Security Threats and Countermeasures. In Proceedings of the 1996 IEEE Symp. on Security and Privacy, IEEE Computer Society Press, pages 129–140, 1996.
X. Yu, M. Yung. Agent Rendezvous: A Dynamic Symmetry-Breaking Problem. In Proceedings of the 1996 ICALP. Lecture Notes in Computer Science, Springer, July 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Young, A., Yung, M. (1997). Sliding encryption: A cryptographic tool for mobile agents. In: Biham, E. (eds) Fast Software Encryption. FSE 1997. Lecture Notes in Computer Science, vol 1267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052350
Download citation
DOI: https://doi.org/10.1007/BFb0052350
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63247-4
Online ISBN: 978-3-540-69243-0
eBook Packages: Springer Book Archive