L-019 A Keyed-Hashing Chain Scheme and its Security Analysis against Timing Attack
スポンサーリンク
概要
- 論文の詳細を見る
Recently, a number of serious and realistic draw back of Database Management System, called timing vulnerability, are reported. The malicious users such as spammers can learn whether or not the user-data are comprised in database, using a timing attack. At this moment, the most popular countermeasure is unifying the time distance between HTTP requests and their responses. However, the time distance must be made consistent with the worst case. This raises a new problem for time efficiency. Whereas, if we simply substitute keyed-hashing for hashing at the chain scheme, it seems not only efficient but also secure against the timing attack. In this paper, we define the security of data-structure against timing attack, and evaluate the keyed-hashing chain scheme.
- FIT(電子情報通信学会・情報処理学会)推進委員会の論文
- 2010-08-20
著者
関連論文
- L-019 A Keyed-Hashing Chain Scheme and its Security Analysis against Timing Attack
- H-005 撮像画像による床素材の静摩擦係数の推定(H分野:画像認識・メディア理解,一般論文)
- I-058 微小形状特徴と微小凹凸特徴による床素材の静摩擦係数の推定(画像処理応用,I分野:グラフィクス・画像)