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

Armon Dadgar

dblp:98/8732 · DBLP profile ↗
← Back
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

Security and privacy · 2

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
Systems and software security · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › trusted computing
trusted computing base
0.112010
Retaining sandbox containment despite bugs in privileged memory-safe code · CCS 2010
Systems and software security
memory safety
0.012010
Retaining sandbox containment despite bugs in privileged memory-safe code · CCS 2010

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

sandbox design · 0.1privilege separation · 0.1
YearPublicationVenuePosition
2020 Informed Privilege-Complexity Trade-Offs in RBAC Configuration
abstract
Role-Based Access Control (RBAC) has the potential both to simplify administration and improve an organization's security. But for non-trivial configurations, there is a conflict between defining fine-grained roles which adhere to the principle of least privilege, and coarse-grained roles which simplify administration by reducing configuration complexity. In this paper we propose OnPar, a multi-objective role mining approach which introduces minimization of unnecessary privilege as a role mining objective, along with an associated unnecessary privilege metric. These allow an RBAC configuration's level of adherence to the principle of least privilege to be reasoned about and traded off against other objectives, including minimization of configuration complexity. A key feature of our approach is the elimination of user tuning of global optimization weights. We show experimentally that this tuning typically leads to the evaluation of sub-optimal candidates, while still missing many optimal candidates. To avoid these issues we leverage Pareto optimality and introduce multi-stage Pareto filtering and the hypervolume indicator to role mining. Their use allows OnPar to efficiently select a small set of candidates for evaluation by the administrator, which are equal best and representative of the full range of trade-offs that were found. Our experimental results demonstrate the effectiveness of this approach across a wide range of input configurations.
Jon Currey, Robbie McKinstry, Armon Dadgar, Mark Gritter
SACMAT3
2010 Retaining sandbox containment despite bugs in privileged memory-safe code
abstract
Flaws in the standard libraries of secure sandboxes represent a major security threat to billions of devices worldwide. The standard libraries are hard to secure because they frequently need to perform low-level operations that are forbidden in untrusted application code. Existing designs have a single, large trusted computing base that contains security checks at the boundaries between trusted and untrusted code. Unfortunately, flaws in the standard library often allow an attacker to escape the security protections of the sandbox.
Justin Cappos, Armon Dadgar, Jeff Rasley, Justin Samuel, Ivan Beschastnikh, Cosmin Barsan, Arvind Krishnamurthy, Thomas E. Anderson
CCS2