Verification of the security against inference attacks on XML databases

  • Authors:
  • Kenji Hashimoto;Fumikazu Takasuka;Kimihide Sakano;Yasunori Ishihara;Toru Fujiwara

  • Affiliations:
  • Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan

  • Venue:
  • APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A verification framework for the security against inference attacks on XML databases is proposed. The framework treats a concept called k-secrecy with an integer k 1 (or k = ∞), which 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. The security verification methods proposed in the framework are applicable to practical cases where authorized queries extract some nodes according to any of their neighboring nodes such as ancestors, descendants, and siblings. Also, using experimental results of prototype systems, we discuss time efficiency of the proposed verification methods.