Demo Data from EDBT 2026 / reviewers in the wild / expert
Brad Marshall
dblp:23/7070
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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 |
Authentication and access control · 67% Usable security · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control
access control |
0.4 | 1 | 2020 | Block public access: trust safety verification of access control policies · ESEC/SIGSOFT FSE 2020 |
Authentication and access control › access control
policy verification |
0.4 | 1 | 2020 | Block public access: trust safety verification of access control policies · ESEC/SIGSOFT FSE 2020 |
Usable security
trust and safety |
0.4 | 1 | 2020 | Block public access: trust safety verification of access control policies · ESEC/SIGSOFT FSE 2020 |
Cloud and datacenter computing › cloud security
access control policies |
0.1 | 1 | 2020 | Block public access: trust safety verification of access control policies · ESEC/SIGSOFT FSE 2020 |
Cloud and datacenter computing
cloud security |
0.1 | 1 | 2020 | Block public access: trust safety verification of access control policies · ESEC/SIGSOFT FSE 2020 |
Methods — techniques the papers use, named apart from their topics
residual policy computation · 0.9formal verification · 0.9SMT solving · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Block public access: trust safety verification of access control policiesabstractData stored in cloud services is highly sensitive and so access to it is controlled via policies written in domain-specific languages (DSLs). The expressiveness of these DSLs provides users flexibility to cover a wide variety of uses cases, however, unintended misconfigurations can lead to potential security issues. We introduce Block Public Access, a tool that formally verifies policies to ensure that they only allow access to trusted principals, i.e. that they prohibit access to the general public. To this end, we formalize the notion of Trust Safety that formally characterizes whether or not a policy allows unconstrained (public) access. Next, we present a method to compile the policy down to a logical formula whose unsatisfiability can be (1) checked by SMT and (2) ensures Trust Safety. The constructs of the policy DSLs render unsatisfiability checking PSPACE-complete, which precludes verifying the millions of requests per second seen at cloud scale. Hence, we present an approach that leverages the structure of the policy DSL to compute a much smaller residual policy that corresponds only to untrusted accesses. Our approach allows Block Public Access to, in the common case, syntactically verify Trust Safety without having to query the SMT solver. We have implemented Block Public Access and present an evaluation showing how the above optimization yields a low-latency policy verifier that the S3 team at AWS has integrated into their authorization system, where it is currently in production, analyzing millions of policies everyday to ensure that client buckets do not grant unintended public access. Malik Bouchet, Byron Cook, Bryant Cutler, Anna Druzkina, Andrew Gacek, Liana Hadarean, Ranjit Jhala, Brad Marshall, Daniel Peebles, Neha Rungta, Cole Schlesinger, Chriss Stephens, Carsten Varming, Andy Warfield |
ESEC/SIGSOFT FSE | 8 |
| 2009 | AmiGO: online access to ontology and annotation dataabstractAbstract AmiGO is a web application that allows users to query, browse and visualize ontologies and related gene product annotation (association) data. AmiGO can be used online at the Gene Ontology (GO) website to access the data provided by the GO Consortium1; it can also be downloaded and installed to browse local ontologies and annotations.2 AmiGO is free open source software developed and maintained by the GO Consortium. Availability: http://amigo.geneontology.org Download: http://sourceforge.net/projects/geneontology/ Contact: [email protected] Seth Carbon, Amelia Ireland, Chris Mungall, Shengqiang Shu, Brad Marshall, Suzanna Lewis |
Bioinform. | 5 |