A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the consistency of distributed proofs with hidden subtrees
2010
ACM Transactions on Privacy and Security
Previous work has shown that distributed authorization systems that fail to sample a consistent snapshot of the underlying system during policy evaluation are vulnerable to a number of attacks. Unfortuantely, the consistency enforcement solutions presented in previous work were designed for systems in which only CA-certified evidence is used during the decision making process, all of which is available to the decision-making node at runtime. In this paper, we generalize previous results and
doi:10.1145/1805974.1805981
fatcat:3opib334yff2rlflu5k7gintvq