A Note on the Random Oracle Methodology

スポンサーリンク

概要

• 論文の詳細を見る

• Canetti et al. [5] showed that there exist signature and encryption schemes that are secure in the random oracle (RO) model, but for which any implementation of the RO (by a single function or a function ensemble) results in insecure schemes. Their result greatly motivates the design of cryptographic schemes that are secure in the standard computational model. This paper gives some new results on the RO methodology. First, we give the necessary and sufficient condition for the existence of a signature scheme that is secure in the RO model but where, for any implementation of the RO, the resulting scheme is insecure. Next, we show that this condition induces a signature scheme that is insecure in the RO model, but that there is an implementation of the RO that makes the scheme secure.

• （社）電子情報通信学会の論文
• 2008-02-01

著者

• NISHIOKA Mototsugu

  Systems Lab., HITACHI Ltd.

• Komatsu Naohisa

  Faculty Of Science And Engineering School Of Fundamental Science And Engineering Waseda University

• Nishioka Mototsugu

  Systems Lab. Hitachi Ltd.

• Nishioka Mototsugu

  Systems Lab Hitachi Ltd.

• Nishioka Mototsugu

  Hitachi Ltd. Yokohama‐shi Jpn

関連論文

• Public-Key Encryptions with Invariant Security Reductions in the Multi-User Setting
• Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
• Mean delay approximation for the mean waiting time in the GI/GI/1 queueing system (コミュニケーションクオリティ)
• A Note on the Random Oracle Methodology
• Public-Key Encryptions with Invariant Security Reductions in the Multi-User Setting
• Secure Public-Key Encryption from Random Oracle Transformation
• Mean Approximate Formulas for GI/G/1 Processor-Sharing System

スポンサーリンク