A tree-covering problem arising in integrity of tree-structured data

Authors:
Mikhail J. Atallah;Greg N. Frederickson;Ashish Kundu
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA;Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA;Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA
Venue:
Information Processing Letters
Year:
2008

Citing 4
Cited 0

The HP time vault service: exploiting IBE for timed release of confidential information

WWW '03 Proceedings of the 12th international conference on World Wide Web
Scalable and lightweight key distribution for secure group communications

International Journal of Network Management
Securing XML data in third-party distribution systems

Proceedings of the 14th ACM international conference on Information and knowledge management
Indexing information for data forensics

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce and solve a problem motivated by integrity verification in third-party data distribution: Given an undirected tree, find a minimum-cardinality set of simple paths that cover all the tree edges and, secondarily, have smallest total path lengths. We give a linear time algorithm for this problem.