Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A General Model for Authenticated Data Structures
Algorithmica
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Proof-infused streams: enabling authentication of sliding window queries on streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Notarized federated ID management and authentication
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Efficient Content Authentication in Peer-to-Peer Networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Optimal communication complexity of generic multicast key distribution
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 15th ACM conference on Computer and communications security
Efficient integrity checking of untrusted network storage
Proceedings of the 4th ACM international workshop on Storage security and survivability
Dynamic provable data possession
Proceedings of the 16th ACM conference on Computer and communications security
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Analysis of multivariate hash functions
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Time and space efficient algorithms for two-party authenticated data structures
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Super-efficient verification of dynamic outsourced databases
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
Integrity and consistency for untrusted services
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Notarized federated identity management for web services
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Secure key-updating for lazy revocation
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Efficient verification of web-content searching through authenticated web crawlers
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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 log2n + O(1).