Demo Data from EDBT 2026 / reviewers in the wild / expert
April Kwong
dblp:75/1987
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2Databases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Graph data management · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management
path query |
0.0 | 1 | 2001 | Flexible authentication of XML documents · CCS 2001 |
Methods — techniques the papers use, named apart from their topics
digital signatures · 0.0digital signature · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A General Model for Authenticated Data Structures
Chip Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz 0001, April Kwong, Stuart G. Stubblebine |
Algorithmica | 5 |
| 2004 | Flexible authentication of XML documentsabstractXML 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. Premkumar T. Devanbu, Michael Gertz 0001, April Kwong |
J. Comput. Secur. | 3 |
| 2001 | Flexible authentication of XML documentsabstractXML is increasingly becoming the format of choice for information exchange, in critical areas such as government, finance, healthcare and law, where integrity is of the essence. 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 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. Premkumar T. Devanbu, Michael Gertz 0001, April Kwong, Chip Martel, Glen Nuckolls, Stuart G. Stubblebine |
CCS | 3 |
| 2001 | Authentic Publication of XML Document DataabstractWith XML becoming a major standard for the exchange and sharing of data, many applications now rely on XML to publish and utilize Web data. Data sources (data owners), however often do not have the means to provide high performance query mechanisms, serving hundreds of thousands of client queries per day. Furthermore, it is too costly for them to maintain a secure Web information system infrastructure preventing intruders from tampering with the integrity of the data. As a solution to this problem, data owners can distribute XML document data to data publishers who then handle queries from clients on behalf of the data owners. In this paper, we present a novel authentic publication scheme for XML document data that allows clients to efficiently verify query results from data publishers for correctness and completeness. For this, data owners simply provide summary signatures of their data to clients who then use the signatures in addition to verification objects provided by a publisher to authenticate query results. Our approach supports two of the most common forms of XML queries, path and selection queries. The approach is reliable where no trust from publishers is required, and is practical with a reasonably small overhead, both in terms of time and size of the storage. April Kwong, Michael Gertz 0001 |
WISE (1) | 1 |