Sciweavers

Share
EDBT
2010
ACM

How to authenticate graphs without leaking

9 years 2 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for authentication of data. However, no such technique exists for directed graphs, even though such graphs are one of the most widely used data organization structures. Existing schemes for DAGs are authenticity-preserving but not confidentiality-preserving, and lead to leakage of sensitive information during authentication. In this paper, we propose two schemes on how to authenticate DAGs and directed cyclic graphs without leaking, which are the first such schemes in the literature. It is based on the structure of the graph as defined by depth-first graph traversals and aggregate signatures. Graphs are structurally different from trees in that they have four types of edges: tree, forward, cross, and back-edges in a depth-first traversal. The fact that an edge is a forward, cross or a back-edge conveys informa...
Ashish Kundu, Elisa Bertino
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where EDBT
Authors Ashish Kundu, Elisa Bertino
Comments (0)
books