Novel remotely keyed encryption schemes for smart card applications

E. M. Mohamed, Y. M.Y. Hasan, Hiroshi Furukawa

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトル2011 IEEE International Conference on Communications, ICC 2011
DOI
出版物ステータス出版済み - 9 2 2011
イベント2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, 日本
継続期間: 6 5 20116 9 2011

その他

その他2011 IEEE International Conference on Communications, ICC 2011
日本
Kyoto
期間6/5/116/9/11

Fingerprint

Smart cards
Cryptography
Bandwidth
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

これを引用

Mohamed, E. M., Hasan, Y. M. Y., & Furukawa, H. (2011). Novel remotely keyed encryption schemes for smart card applications. : 2011 IEEE International Conference on Communications, ICC 2011 [5962808] https://doi.org/10.1109/icc.2011.5962808

Novel remotely keyed encryption schemes for smart card applications. / Mohamed, E. M.; Hasan, Y. M.Y.; Furukawa, Hiroshi.

2011 IEEE International Conference on Communications, ICC 2011. 2011. 5962808.

研究成果: 著書/レポートタイプへの貢献会議での発言

Mohamed, EM, Hasan, YMY & Furukawa, H 2011, Novel remotely keyed encryption schemes for smart card applications. : 2011 IEEE International Conference on Communications, ICC 2011., 5962808, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, 日本, 6/5/11. https://doi.org/10.1109/icc.2011.5962808
Mohamed EM, Hasan YMY, Furukawa H. Novel remotely keyed encryption schemes for smart card applications. : 2011 IEEE International Conference on Communications, ICC 2011. 2011. 5962808 https://doi.org/10.1109/icc.2011.5962808
Mohamed, E. M. ; Hasan, Y. M.Y. ; Furukawa, Hiroshi. / Novel remotely keyed encryption schemes for smart card applications. 2011 IEEE International Conference on Communications, ICC 2011. 2011.
@inproceedings{792117b886f44747aa3c15f38c31ebe4,
title = "Novel remotely keyed encryption schemes for smart card applications",
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.",
author = "Mohamed, {E. M.} and Hasan, {Y. M.Y.} and Hiroshi Furukawa",
year = "2011",
month = "9",
day = "2",
doi = "10.1109/icc.2011.5962808",
language = "English",
isbn = "9781612842332",
booktitle = "2011 IEEE International Conference on Communications, ICC 2011",

}

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/9/2

Y1 - 2011/9/2

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.

UR - http://www.scopus.com/inward/record.url?scp=80052161607&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052161607&partnerID=8YFLogxK

U2 - 10.1109/icc.2011.5962808

DO - 10.1109/icc.2011.5962808

M3 - Conference contribution

AN - SCOPUS:80052161607

SN - 9781612842332

BT - 2011 IEEE International Conference on Communications, ICC 2011

ER -