Scramble all, encrypt small
(1999) 6th International Workshop on Fast Software Encryption — Location: ROME(Italy) (24.March.1999)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 582.45 KB
Details
- Authors
- 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.
- Affiliations
Citations
Jakobsson, M., Stern, J., & Yung, M. (1999). Scramble all, encrypt small. Lecture Notes in Computer Science, 1636, 95-111. https://doi.org/10.1007/3-540-48519-8_8 (Original work published 1999)