TY - GEN
T1 - Novel remotely keyed encryption schemes for smart card applications
AU - Mohamed, E. M.
AU - Hasan, Y. M.Y.
AU - Furukawa, Hiroshi
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Feistel Network (FN)
KW - LIRKES
KW - LPRKES
KW - Luby-Rackoff Ciphers
KW - Pseudorandom Permutation (PRP)
KW - Smart Card, Pseudorandom Function (PRF)
UR - https://www.scopus.com/pages/publications/80052161607
U2 - 10.1109/icc.2011.5962808
DO - 10.1109/icc.2011.5962808
M3 - Conference contribution
AN - SCOPUS:80052161607
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -