Accelerated Remotely Keyed Encryption Stefan Lucks
Download:
|
|
by Theoretische Informatik
http://th.informatik.uni-mannheim.de/People/Lucks/papers/ARK.ps.gz
Add To MetaCart
Abstract:
Abstract. Remotely keyed encryption schemes (RKESs) support fast encryption and decryption using low-bandwidth devices, such as secure smartcards. The long-lived secret keys never leave the smartcard, but most of the encryption is done on a fast untrusted device, such as the smartcard's host. This paper describes an new scheme, the length-preserving \accelerated remotely keyed " (ARK) encryption scheme and, in a formal model, provides a proof of security. For the sake of practical usability, our model avoids asymptotics. Blaze, Feigenbaum, and Naor gave a general denition for secure RKESs [3]. Compared to their length-preserving scheme, the ARK scheme is more ecient but satises the same security requirements. 1
Citations
| 135 | The security of cipher block chaining – Bellare, Kilian, et al. - 1994 |
| 134 | Pseudorandomness and Cryptographic Applications – Luby - 1996 |
| 39 | High-Bandwidth Encryption with Low-Bandwidth Smartcards – Blaze - 1996 |
| 19 | A Formal Treatment of Remotely Keyed Encryption – Blaze, Feigenbaum, et al. - 1998 |
| 13 | Accelerated Remotely Keyed Encryption – Lucks - 1999 |
