Abstract
The Remotely Keyed Encryption Schemes (RKESs) are greatly useful in solving the vital problem of how to do bulk encryption/decryption for high-bandwidth applications (like multimedia data encryption) in a way that takes advantage of both the superior power of the host and the superior security of the smart card. Accordingly, we propose two novel RKESs, a Length Preserving (LP) RKES and a Length Increasing (LI) RKES. The proposed LPRKES is based on a general view of the well known Feistel-Network (FN) in which we only use two rounds in an efficient and secure way, employing data-dependent cipher-keys. In the LIRKES, an extra ciphertext block is used, encrypting the one-time random cipher-key based on a signature of the whole ciphertext. The security of the presented schemes are theoretically proven and, compared to the state-of-the-art RKESs, the savings in the required computational complexity, run-time, bandwidth, and storage space are emphasized.
Original language | English |
---|---|
Title of host publication | 2011 IEEE International Conference on Communications, ICC 2011 |
DOIs | |
Publication status | Published - Sept 2 2011 |
Event | 2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan Duration: Jun 5 2011 → Jun 9 2011 |
Other
Other | 2011 IEEE International Conference on Communications, ICC 2011 |
---|---|
Country/Territory | Japan |
City | Kyoto |
Period | 6/5/11 → 6/9/11 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering