University of Illinois Urbana-Champaign

Lightweight Consistency Enforcement Schemes for Distributed Proofs with Hidden Subtrees (Extended Version)

Lee, Adam J.; Minami, Kazuhiro; Winslett, Marianne

Content Files
Lightweight Consistency Enforcement Schemes for Distributed Proofs with Hidden Subtrees (Extended Version).pdf

Permalink

https://hdl.handle.net/2142/11324

Description

Title
Lightweight Consistency Enforcement Schemes for Distributed Proofs with Hidden Subtrees (Extended Version)
Author(s)
  • Lee, Adam J.
  • Minami, Kazuhiro
  • Winslett, Marianne
Issue Date
2007-04
Keyword(s)
distributed systems
Date of Ingest
2009-04-22T14:58:23Z
Abstract
In distributed proof construction systems, information release policies can make it unlikely that any single node in the system is aware of the complete structure of any particular proof tree. This property makes it difficult for queriers to determine whether the proofs constructed using these protocols sampled a consistent snapshot of the system state; this has previously been shown to have dire consequences in decentralized authorization systems. Unfortunately, the consistency enforcement solutions presented in previous work were designed for systems in which only information encoded in certificates issued by certificate authorities is used during the decision-making process. Further, they assume that each piece of certified evidence used during proof construction is available to the decision-making node at runtime. In this paper, we generalize these previous results and present lightweight mechanisms through which consistency constraints can be enforced in proof systems in which the full details of a proof may be unavailable to the querier and the existence of certificate authorities for certifying evidence is unlikely; these types of distributed proof systems are likely candidates for use in pervasive computing and sensor network environments. We present modifications to one such distributed proof system that enable two types of consistency constraints to be enforced while still respecting the same confidentiality and integrity policies as the original proof system. Further, we present the details of a performance analysis conducted to illustrate the modest overheads (less than 30%) of consistency enforcement on distributed proof construction.
Type of Resource
text
Genre of Resource
Technical Report
Permalink
http://hdl.handle.net/2142/11324
Copyright and License Information
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections

Research and Tech Reports - Computer Science PRIMARY