Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Glen Nuckolls

dblp:25/3802 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 2 first-authorTheory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
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 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph data management
path query
0.012001
Flexible authentication of XML documents · CCS 2001

Methods — techniques the papers use, named apart from their topics

data provenance · 0.0digital signatures · 0.0digital signature · 0.0
YearPublicationVenuePosition
2005 Verified Query Results from Hybrid Authentication Trees
Glen Nuckolls
DBSec1
2004 A General Model for Authenticated Data Structures
Chip Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz 0001, April Kwong, Stuart G. Stubblebine
Algorithmica2
2003 Certifying Data from Multiple Sources
Glen Nuckolls, Chip Martel, Stuart G. Stubblebine
DBSec1
2003 Certifying data from multiple sources (extended abstract)
abstract
No abstract available.
Glen Nuckolls, Chip Martel, Stuart G. Stubblebine
EC1
2001 Flexible authentication of XML documents
abstract
XML 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
CCS5