Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Comparative analysis of five XML query languages
ACM SIGMOD Record
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
XML Access Control Systems: A Component-Based Approach
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
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
Authentic Publication of XML Document Data
WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
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
Decentralized authorization and data security in web content delivery
Proceedings of the 2007 ACM symposium on Applied computing
Efficient integrity checking of untrusted network storage
Proceedings of the 4th ACM international workshop on Storage security and survivability
Security and privacy for geospatial data: concepts and research directions
SPRINGL '08 Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS
Do You Know Where Your Data's Been? --- Tamper-Evident Database Provenance
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
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
Efficient data structures for tamper-evident logging
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
| Hi-index | 0.00 |
XML is increasingly becoming the format of choice for information exchange on the Internet. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical areas such as healthcare, law and finance, integrity is essential. In such applications, clients must be assured that they are getting complete and correct answers to their queries. Existing methods for signing XML documents cannot be used to establish that an answer to a query is complete. A simple approach has a server processing queries and certifying answers by digitally signing them with an on-line private key; however, the server, and its on-line private key, would be vulnerable to external hacking and insider attacks. We propose a new approach to signing XML documents which allows untrusted servers to answer certain types of path queries and selection queries over XML documents without the need for trusted on-line signing keys. This approach enhances both the security and scalability of publishing information in XML format over the Internet. In addition, it provides greater flexibility in authenticating parts of XML documents, in response to commercial or security policy considerations.