See this document in CiteSeerX!

Computational Bounds on Hierarchical Data Processing with Applications to Information Security (2005)  (Make Corrections)  (1 citation)
Roberto Tamassia, Nikos Triandopoulos



  Home/Search   Context   Related

 
View or download:
brown.edu/cgc/stms/papers/cbhdp.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tcs.hut.fi/~helger/crypto/link... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Motivated by algorithmic problems in the domain of information security, we study the complexity of a new class of computations over sets of elements. In this paper, we introduce hierarchical data processing, a generic class of problems for which, broadly speaking, the computation of a collection of output values from an input set of n elements is fully described by a directed acyclic graph (DAG). In particular, computations are performed and data is processed according to the hierarchy... (Update)

Cited by:   More
Secure Key-Updating for Lazy Revocation - Backes, Cachin, Oprea (2005)   (Correct)

Active bibliography (related documents):   More   All
0.8:   CATS: Certified Authenticated Tamper-evident State Store.. - Yumerefendi, Chase   (Correct)
0.8:   Authentication of Embedded Data in HTML Documents through the Use .. - Straub (2003)   (Correct)
0.7:   An Efficient Dynamic and Distributed Cryptographic.. - Goodrich, Tamassia, Hasic (2002)   (Correct)

Similar documents based on text:   More   All
0.7:   Resume - Triandopoulos   (Correct)
0.4:   On the Cost of Authenticated Data Structures - Tamassia, Triandopoulos (2003)   (Correct)
0.3:   Multicast Authentication in Fully Adversarial Networks - Anna Lysyanskaya Roberto   (Correct)

BibTeX entry:   (Update)

R. Tamassia and N. Triandopoulos, "Computational bounds on hierarchical data processing with applications to information security," in Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005. http://citeseer.ist.psu.edu/tamassia05computational.html   More

@misc{ tamassia05computational,
  author = "R. Tamassia and N. Triandopoulos",
  title = "Computational bounds on hierarchical data processing with applications
    to information security",
  text = "R. Tamassia and N. Triandopoulos, Computational bounds on hierarchical
    data processing with applications to information security, in Proc. 32nd
    International Colloquium on Automata, Languages and Programming (ICALP),
    2005.",
  year = "2005",
  url = "citeseer.ist.psu.edu/tamassia05computational.html" }
Citations (may not include all citations):
2003   The art of computer programming (context) - Knuth - 1973
837   Cambridge University Press (context) - Motwani, Raghavan - 1995
182   Skip lists: a probabilistic alternative to balanced trees - Pugh - 1990
159   Non-interactive and information-theoretic secure verifiable .. (context) - Pedersen - 1992
151   Secure group communications using key graphs - Wong, Gouda et al. - 2000
119   Protocols for public key cryptosystems (context) - Merkle - 1980
112   Broadcast encryption - Fiat, Naor - 1994
104   A certified digital signature (context) - Merkle - 1990
77   Certificate revocation and certificate update - Naor, Nissim - 1998
59   Key establishment in large dynamic groups using one-way func.. - McGrew, Sherman - 1998
59   Key establishment in large dynamic groups using one-way func.. - Sherman, McGrew - 2003
55   Randomized search trees (context) - Aragon, Seidel - 1989
55   Revocation and tracing schemes for stateless receivers - Naor, Naor et al. - 2001
48   On certificate revocation and validation (context) - Kocher - 1998
48   Key management for secure internet multicast using boolean f.. - Chang, Engel et al. - 1999
39   Authentic third-party data publication - Devanbu, Gertz et al. - 2000
35   Implementation of an authenticated dictionary with skip list.. - Goodrich, Tamassia et al. - 2001
30   Multicast security: A taxonomy and some e#cient construction.. (context) - Canetti, Garay et al. - 1999
28   Secure history preservation through timeline entanglement - Maniatis, Baker - 2002
28   Dynamic accumulators and application to e#cient revocation o.. (context) - Camenisch, Lysyanskaya - 2002
22   Persistent authenticated dictionaries and their applications - Anagnostopoulos, Goodrich et al. - 2001
19   Accountable certificate management using undeniable attestat.. - Buldas, Laud et al. - 2000
19   Flexible authentication of XML documents - Devanbu, Gertz et al. - 2001
19   A lower bound for multicast key distribution - Snoeyink, Suri et al. - 2001
16   Authenticated data structures for graph and geometric search.. - Goodrich, Tamassia et al. - 2003
12   Enabling the archival storage of signed documents - Maniatis, Baker - 2002
12   A general model for authentic data publication - Martel, Nuckolls et al. - 2001
12   cient trace and revoke schemes (context) - Naor, Pinkas - 2000
9   Zero-Knowledge sets - Micali, Rabin et al. - 2003
8   Technical Report CS-TR (context) - Pugh, cookbook - 1989
7   cient tree-based revocation in groups of low-state devices (context) - Goodrich, Sun et al. - 2004
7   Using AVL trees for fault tolerant group key management - Rodeh, Birman et al. - 2001
6   cient authenticated dictionaries with skip lists and commuta.. (context) - Goodrich, Tamassia - 2000
6   Marks: Zero side e#ect multicast key management using arbitr.. (context) - Briscoe - 1999
6   cient communication - storage tradeo#s for multicast encrypt.. (context) - Canetti, Malkin et al. - 1999
5   cient and fresh certification (context) - Gassko, Gemmell et al. - 2000
5   Randomized binary search trees (context) - Martnez, Roura - 1998
4   cient dynamic and distributed cryptographic accumulator (context) - Goodrich, Tamassia et al. - 2002
3   Algorithms for dynamic multicast key distribution trees - Goshi, Ladner - 2002
2   cient kerberized multicast in a practical distributed settin.. (context) - Crescenzo, Kornievskaia - 2001
2   Authenticated dictionaries for fresh attribute credentials - Goodrich, Shin et al. - 2003
2   Authenticating distributed data using Web services and XML s.. - Polivy, Tamassia - 2002
2   cient state updates for key management (context) - Pinkas - 2001
1   Design and implementation of a distributed authenticated dic.. (context) - Goodrich, Lentini et al. - 2002
1   CRC Press Series (context) - Stinson, Theory et al. - 2002
1   Optimal communication complexity of generic multicast key di.. (context) - Micciancio, Panjwani - 2003
1   Goding constructions for blackliting problems without comput.. (context) - Kumar, Rajagopalan et al. - 1999
1   RFC 2627 -- Key management for multicast: issues and archite.. (context) - Wallner, Harder et al. - 1998
1   cient consistency proofs for generalized queries on 32 a com.. (context) - Ostrovsky, Racko et al. - 2004
1   Authenticating Web content with prooflets (context) - Shin, Straub et al. - 2002

Documents on the same site (http://www.tcs.hut.fi/~helger/crypto/link/data_structures/):   More
Persistent Authenticated Dictionaries and Their.. - Anagnostopoulos.. (2001)   (Correct)
Dynamic Accumulators and Application to Efficient.. - Camenisch, Lyasyanskaya (2002)   (Correct)
Authentication of Embedded Data in HTML Documents through the Use .. - Straub (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC