Stateful Key Encapsulation Mechanism

• Item type: SIG Technical Reports(1)
• 公開日: 2009-06-25
• タイトル: Stateful Key Encapsulation Mechanism
• タイトル / 言語: en
• タイトル: Stateful Key Encapsulation Mechanism
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: The University of Tokyo.
• 著者所属: Research Center for Information Security, Advanced Industrial Science and Technology.
• 著者所属: The University of Tokyo.
• 著者所属: Research Center for Information Security, Advanced Industrial Science and Technology.
• 著者所属(英): en
• 著者所属(英): The University of Tokyo.
• 著者所属(英): en
• 著者所属(英): Research Center for Information Security, Advanced Industrial Science and Technology.
• 著者所属(英): en
• 著者所属(英): The University of Tokyo.
• 著者所属(英): en
• 著者所属(英): Research Center for Information Security, Advanced Industrial Science and Technology.
• 著者名: Peng, Yang; Rui, Zhang; Kanta, Matsuura; Hideki, Imai
• 著者名(英): Peng, Yang; Rui, Zhang; Kanta, Matsuura; Hideki, Imai
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The concept of stateful encryption was introduced to reduce computation cost of conventional public key encryption schemes. Bellare et al. proposed one stateful encryption scheme in random oracle model which can save one exponentiation from two, and another scheme in the standard model which can save one exponentiation from three. To remove the gap assumption in Bellare's random oracle scheme, Yang et al. showed a trade-off between assumption and computation. Above, all the schemes were built in the same manner: using an IND-CCA secure symmetric key encryption to achieve data privacy, and the symmetric key being provided by a key encapsulation. This means the provable security of all above schemes depends on the security of both symmetric key encryption and key encapsulation. In this paper, we first formalize the key encapsulation part, i.e., we propose a new primitive named stateful key encapsulation mechanism. Then, we show how to achieve stateful encryption by composing our primitive and symmetric encryption in a generic way.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: The concept of stateful encryption was introduced to reduce computation cost of conventional public key encryption schemes. Bellare et al. proposed one stateful encryption scheme in random oracle model which can save one exponentiation from two, and another scheme in the standard model which can save one exponentiation from three. To remove the gap assumption in Bellare's random oracle scheme, Yang et al. showed a trade-off between assumption and computation. Above, all the schemes were built in the same manner: using an IND-CCA secure symmetric key encryption to achieve data privacy, and the symmetric key being provided by a key encapsulation. This means the provable security of all above schemes depends on the security of both symmetric key encryption and key encapsulation. In this paper, we first formalize the key encapsulation part, i.e., we propose a new primitive named stateful key encapsulation mechanism. Then, we show how to achieve stateful encryption by composing our primitive and symmetric encryption in a generic way.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11235941
• 書誌情報: 研究報告コンピュータセキュリティ（CSEC）; 巻 2009-CSEC-46, 号 42, p. 1-6, 発行日 2009-06-25
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会