Abstract
The purpose of remotely keyed encryption is to efficiently realize a secret-key block cipher by sharing the computational burden between a fast untrusted device and a slow device trusted with the key. This paper deals with how to define the security of remotely keyed encryption schemes. Since the attacker can take over the slow device and actually take part in the encryption process, common definitions of the security of block ciphers have to be reconsidered.
Using random mappings, collision resistant hash functions, and stream ciphers as building blocks, the Random Mapping based Remotely Keyed (RaMaRK) encryption scheme is proposed. Also GRIFFIN is proposed, a fast new block cipher for flexible but large blocks. The RaMaRK scheme and GRIFFIN are provably secure if the underlying building blocks are secure.
Chapter PDF
References
W. Aiello, R. Venkatesan, “Foiling Birthday Attacks in Length-Doubling Transformations≓, in Eurocrypt’96 (ed. U. Maurer), Springer LNCS 1070, 307–320, 1996.
R. Anderson, “The Classification of Hash Functions≓, in Fourth IMA conference on cryptography and coding, 83–93, 1993.
R. Anderson, E. Biham, “Two Practical and Provably Secure Block Ciphers: BEAR and LION≓, in Fast Software Encryption (ed. D. Gollmann), Springer LNCS 1039, 113–120, 1996.
M. Bellare, P. Rogaway, “Random Oracles are Practical: A Paradigm for Designing Efficient Protocols≓, in First ACM Conference on Computer and Communications Security, ACM, 1993.
M. Blaze, “High-Bandwidth Encryption with Low-Bandwidth Smartcards≓, in Fast Software Encryption (ed. D. Gollmann), Springer LNCS 1039, 33–40, 1996.
M. Luby, C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Functions≓, SIAM J. Computing, Vol. 17, No. 2, 373–386, 1988.
S. Lucks, “Faster Luby-Rackoff Ciphers≓, in Fast Software Encryption (ed. D. Gollmann), Springer LNCS 1039, 189–203, 1996.
S. Lucks, “BEAST: A Fast Block Cipher for Arbitrary Blocksizes≓, in IFIP Conference on Communications and Multimedia Security (ed. P. Horster), Chapman & Hall, 144–153, 1996.
B. Preneel, P. van Oorschot, “On the Security of Two MAC Algorithms≓, in Eurocrypt ’96 (ed. U. Maurer), Springer LNCS 1070, 19–32, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Lucks, S. (1997). On the security of remotely keyed encryption. In: Biham, E. (eds) Fast Software Encryption. FSE 1997. Lecture Notes in Computer Science, vol 1267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052349
Download citation
DOI: https://doi.org/10.1007/BFb0052349
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