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

Tanya Verma

dblp:279/3338 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · conflict

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

Security and privacy · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021

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
2 papers
Cryptographic primitives and cryptanalysis · 88% Systems and software security · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Distributed systems · 50%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.812024
ISABELLA: Improving Structures of Attribute-Based Encryption Leveraging Linear Algebra · CCS 2024
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
multi-authority attribute-based encryption
0.812024
ISABELLA: Improving Structures of Attribute-Based Encryption Leveraging Linear Algebra · CCS 2024
Cloud and datacenter computing
access control
0.712023
Portunus: Re-imagining Access Control in Distributed Systems · USENIX ATC 2023
Distributed systems › distributed system security
distributed access control
0.712023
Portunus: Re-imagining Access Control in Distributed Systems · USENIX ATC 2023

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

capability-based access control · 1.3pairing-based cryptography · 0.8linear algebra · 0.8
YearPublicationVenuePosition
2024 ISABELLA: Improving Structures of Attribute-Based Encryption Leveraging Linear Algebra
abstract
Attribute-based encryption (ABE) is a powerful primitive that has found applications in important real-world settings requiring access control. Compared to traditional public-key encryption, ABE has established itself as a considerably more complex primitive that is additionally less efficient to implement. It is therefore paramount that the we can simplify the design of ABE schemes that are efficient, provide strong security guarantees, minimize the complexity in their descriptions and support all practical features that are desirable for common real-world settings. One of such practical features that is currently still difficult to achieve is multi-authority support. Motivated by NIST's ongoing standardization efforts around multi-authority schemes, we put a specific focus on simplifying the support of multiple authorities in the design of schemes. Abstract: Code to separate paragraphs
Doreen Riepel, Marloes Venema, Tanya Verma
CCS3
2023 Portunus: Re-imagining Access Control in Distributed Systems
Watson Ladd, Tanya Verma, Marloes Venema, Armando Faz-Hernández, Brendan McMillion, Avani Wildani, Nick Sullivan
USENIX ATC2
2021 Oblivious DNS over HTTPS (ODoH): A Practical Privacy Enhancement to DNS
abstract
Abstract The Internet’s Domain Name System (DNS) responds to client hostname queries with corresponding IP addresses and records. Traditional DNS is unencrypted and leaks user information to on-lookers. Recent efforts to secure DNS using DNS over TLS (DoT) and DNS over HTTPS (DoH) have been gaining traction, ostensibly protecting DNS messages from third parties. However, the small number of available public large-scale DoT and DoH resolvers has reinforced DNS privacy concerns, specifically that DNS operators could use query contents and client IP addresses to link activities with identities. Oblivious DNS over HTTPS (ODoH) safeguards against these problems. In this paper we implement and deploy interoperable instantiations of the protocol, construct a corresponding formal model and analysis, and evaluate the protocols’ performance with wide-scale measurements. Results suggest that ODoH is a practical privacy-enhancing replacement for DNS.
Sudheesh Singanamalla, Suphanat Chunhapanya, Jonathan Hoyland, Marek Vavrusa, Tanya Verma, Peter Wu, Marwan Fayed, Kurtis Heimerl, Nick Sullivan, Christopher A. Wood
Proc. Priv. Enhancing Technol.5