Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A General Model for Authenticated Data Structures
Algorithmica
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A privacy-preserving index for range queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Integrity checking in cryptographic file systems with constant trusted storage
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Authenticated dictionaries for fresh attribute credentials
iTrust'03 Proceedings of the 1st international conference on Trust management
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Authenticated relational tables and authenticated skip lists
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Implementing a tamper-evident database system
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Authentication of outsourced databases using signature aggregation and chaining
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Athos: Efficient Authentication of Outsourced File Systems
ISC '08 Proceedings of the 11th international conference on Information Security
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
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
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Proceedings of the 2012 ACM conference on Computer and communications security
Verifiable delegation of computation on outsourced data
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Authenticated data structures, generically
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in database outsourcing, a client's database is stored and maintained by an untrusted server. Also, in simple storage systems, clients can store very large amounts of data but at the same time, they want to assure their integrity when they retrieve them. In this paper, we present a model and protocol for two-party authentication of data structures. Namely, a client outsources its data structure and verifies that the answers to the queries have not been tampered with. We provide efficient algorithms to securely outsource a skip list with logarithmic time overhead at the server and client and logarithmic communication cost, thus providing an efficient authentication primitive for outsourced data, both structured (e.g., relational databases) and semi-structured (e.g., XML documents). In our technique, the client stores only a constant amount of space, which is optimal. Our two-party authentication framework can be deployed on top of existing storage applications, thus providing an efficient authentication service. Finally, we present experimental results that demonstrate the practical efficiency and scalability of our scheme.