Scramble all, encrypt small

21Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we propose a new design tool for \block encryption", allowing the en/decryption of arbitrarily long messages, but performing en/decryption on only a single block (e.g., 128 bit block), where the rest of the message is only processed by a good scrambling function (e.g., one based on an ideal hash function). The design can be a component in constructing various schemes where the above properties gives an advantage. A quite natural use of our scheme is for remotely keyed encryption. We actually solve an open problem (at least in the relaxed ideal hash model and where hosts are allowed to add randomness and integrity checks, thus giving a length increasing function); namely, we show the existence of a secure remotely keyed encryption scheme which performs only one interaction with the smart-card device.

Cite

CITATION STYLE

APA

Jakobsson, M., Stern, J. P., & Yung, M. (1999). Scramble all, encrypt small. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1636, pp. 95–111). Springer Verlag. https://doi.org/10.1007/3-540-48519-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free