Prefix compression of sparse binary strings
Crossroads
ACM Computing Surveys (CSUR)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
Authenticating Query Results in Edge Computing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A General Model for Authenticated Data Structures
Algorithmica
Selective and Authentic Third-Party Distribution of XML Documents
IEEE Transactions on Knowledge and Data Engineering
Verifying completeness of relational query results in data publishing
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Authentication and integrity in outsourced databases
ACM Transactions on Storage (TOS)
CADS: continuous authentication on data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query assurance verification for outsourced multi-dimensional databases
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Partially materialized digest scheme: an efficient verification method for outsourced databases
The VLDB Journal — The International Journal on Very Large Data Bases
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
Authenticating multi-dimensional query results in data publishing
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Authentication of outsourced databases using signature aggregation and chaining
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Verified query results from hybrid authentication trees
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Authenticating query results in data publishing
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Verifying spatial queries using Voronoi neighbors
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
A signature-based approach of correctness assurance in data outsourcing scenarios
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Integrity verification of cloud-hosted data analytics computations
Proceedings of the 1st International Workshop on Cloud Intelligence
Efficient query integrity for outsourced dynamic databases
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Authentication of moving range queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
CorrectDB: SQL engine with practical query authentication
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Query answers from servers operated by third parties need to be verified, as the third parties may not be trusted or their servers may be compromised. Most of the existing authentication methods construct validity proofs based on the Merkle hash tree (MHT). The MHT, however, imposes severe concurrency constraints that slow down data updates. We introduce a protocol, built upon signature aggregation, for checking the authenticity, completeness and freshness of query answers. The protocol offers the important property of allowing new data to be disseminated immediately, while ensuring that outdated values beyond a pre-set age can be detected. We also propose an efficient verification technique for ad-hoc equijoins, for which no practical solution existed. In addition, for servers that need to process heavy query workloads, we introduce a mechanism that significantly reduces the proof construction time by caching just a small number of strategically chosen aggregate signatures. The efficiency and efficacy of our proposed mechanisms are confirmed through extensive experiments.