Output details

Security Analysis of Cryptographically Controlled Access to XML Documents

<19> This paper forms part of a body of work of Warinschi on "computational soundness", which is the main technique to match up the methodologies of provable security and formal techniques. The paper, explains, for the first time, how to apply the techniques of computational soundness to access control schemes used in the field of semi-structured databases.

This output accounts for more realistic attackers than pre-2008 conference proceeding. The new attacks deal with information an attacker may infer from encrypted documents and with more realistic attacker abilities. It investigates a more powerful adversary (capable of "selective-decryption" attacks) and explains why defeating this adversary is impossible, given the state-of-the-art cryptography.

The output's new extensions need tailored definitions, constructions, theorems and proofs. Furthermore, the discussion and details are more extensive than in the conference version. The major new technical contributions over the conference version are in Section 5 (and include Definition-4, Theorems 5&7) and in Appendix.