Abstract
We introduce hierarchical data processing (HDP) problems, a class of computations over a collection of values associated with a set of n elements, based on a directed acyclic graph (DAG). We present an Ω(log n) lower bound on various computational cost measures for HDP problems and we develop an efficient randomized DAG scheme for HDP problems. We apply our results to data authentication through cryptographic hashing and multicast key distribution using key-graphs. We show that both problems involve HDP and prove logarithmic lower bounds on their computational and communication costs. Using our new DAG scheme, we present a new efficient authenticated dictionary and a new skip-list version with expected search complexity 1.25 log2 n + O(1).
This work was supported in part by NSF grants CCF–0311510, IIS–0324846 and CNS–0303577.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 61. Springer, Heidelberg (2002)
Canetti, R., Malkin, T., Nissim, K.: Efficient communication - storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 459. Springer, Heidelberg (1999)
Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.G.: Authentic data publication over the Internet. Journal of Computer Security 11(3) (2003)
Goodrich, M.T., Tamassia, R., Hasic, J.: An efficient dynamic and distributed cryptographic accumulator. In: Proc. ISC (2002)
Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proc. DISCEX (2001)
Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R.: Authenticated data structures for graph and geometric searching. In: Proc. RSA-CT (2003)
Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica 39(1) (2004)
Micali, S., Rabin, M., Kilian, J.: Zero-Knowledge sets. In: Proc. FOCS (2003)
Micciancio, D., Panjwani, S.: Optimal communication complexity of generic multicast key distribution. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 153–170. Springer, Heidelberg (2004)
Naor, M., Nissim, K.: Certificate revocation and certificate update. In: Proc. USENIX Security (1998)
Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proofs for generalized queries on a committed database. In: Proc. ICALP (2004)
Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. CACM 33(6) (1990)
Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: Proc. INFOCOMM (2001)
Tamassia, R., Triandopoulos, N.: Computational bounds on hierarchical data processing with applications to information security, Brown University (2005) (manuscript) Full version http://www.cs.brown.edu/cgc/stms/papers/cbhdp.pdf
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Transactions on Networking 8(1) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tamassia, R., Triandopoulos, N. (2005). Computational Bounds on Hierarchical Data Processing with Applications to Information Security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_13
Download citation
DOI: https://doi.org/10.1007/11523468_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)