Verification of the Security against Inference Attacks on XML Databases

  • HASHIMOTO Kenji
    Graduate School of Information Science and Technology, Osaka University
  • SAKANO Kimihide
    Graduate School of Information Science and Technology, Osaka University
  • TAKASUKA Fumikazu
    Graduate School of Information Science and Technology, Osaka University
  • ISHIHARA Yasunori
    Graduate School of Information Science and Technology, Osaka University
  • FUJIWARA Toru
    Graduate School of Information Science and Technology, Osaka University

この論文をさがす

抄録

This paper discusses verification of the security against inference attacks on XML databases. First, a security definition called k-secrecy against inference attacks on XML databases is proposed. k-secrecy with an integer k > 1 (or k = ∞) means that attackers cannot narrow down the candidates for the value of the sensitive information to k - 1 (or finite), using the results of given authorized queries and schema information. Secondly, an XML query model such that verification can be performed straightforwardly according to the security definition is presented. The query model can represent practical queries which extract some nodes according to any of their neighboring nodes such as ancestors, descendants, and siblings. Thirdly, another refinement of the verification method is presented, which produces much smaller intermediate results if a schema contains no arbitrarily recursive element. The correctness of the refinement is proved, and the effect of the refinement in time and space efficiency has been confirmed by experiment.

収録刊行物

被引用文献 (4)*注記

もっと見る

参考文献 (32)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ