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.

Lucy Li

dblp:174/9518 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · conflict

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

Security and privacy · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
3 papers
Cryptographic primitives and cryptanalysis · 45% Authentication and access control · 29% Privacy and data protection · 26%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › data confidentiality
encrypted storage
0.412020
Pancake: Frequency Smoothing for Encrypted Data Stores · USENIX Security Symposium 2020
Authentication and access control › password security
compromised credential checking
0.412019
Protocols for Checking Compromised Credentials · CCS 2019
Cryptographic primitives and cryptanalysis › encryption
deterministic encryption
0.412019
The Local Forking Lemma and Its Application to Deterministic Encryption · ASIACRYPT (3) 2019
Cryptographic primitives and cryptanalysis
forking lemma
0.412019
The Local Forking Lemma and Its Application to Deterministic Encryption · ASIACRYPT (3) 2019
Authentication and access control
password authentication
0.112019
Protocols for Checking Compromised Credentials · CCS 2019

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

frequency smoothing · 0.9threat modeling · 0.4empirical leakage analysis · 0.4
YearPublicationVenuePosition
2023 Understanding Research Related to Designing for Children's Privacy and Security: A Document Analysis
abstract
Many children are growing up in a “digital-by-default” world, where technologies mediate many of their interactions. There is emerging consensus that those who design technology must support children's privacy and security. However, privacy and security are complex concepts that are challenging to design for, and centering the interests of children is similarly difficult. Through a document analysis of 90 HCI publications, we examine what problems and solutions designing for children's privacy and security addresses and how this research engages with children. Applying Solove's privacy taxonomy, we find that research addresses a range of problems related to information collection, processing, dissemination, and invasion at the organizational, system, and individual levels. Children's participation in this research is largely limited to providing feedback rather than helping to guide the research itself. Based on these findings, we offer recommendations for designers to sharpen their privacy and security contributions and center children in their work.
Priya Kumar 0001, Fiona O'Connell, Lucy Li, Virginia Byrne, Marshini Chetty, Tamara L. Clegg, Jessica Vitak
IDC3
2020 Pancake: Frequency Smoothing for Encrypted Data Stores
Paul Grubbs, Anurag Khandelwal, Marie-Sarah Lacharité, Lloyd Brown, Lucy Li, Rachit Agarwal 0001, Thomas Ristenpart
USENIX Security Symposium5
2019 The Local Forking Lemma and Its Application to Deterministic Encryption
Mihir Bellare, Wei Dai 0011, Lucy Li
ASIACRYPT (3)3
2019 Protocols for Checking Compromised Credentials
abstract
To prevent credential stuffing attacks, industry best practice now proactively checks if user credentials are present in known data breaches. Recently, some web services, such as HaveIBeenPwned (HIBP) and Google Password Checkup (GPC), have started providing APIs to check for breached passwords. We refer to such services as compromised credential checking (C3) services. We give the first formal description of C3 services, detailing different settings and operational requirements, and we give relevant threat models. One key security requirement is the secrecy of a user's passwords that are being checked. Current widely deployed C3 services have the user share a small prefix of a hash computed over the user's password. We provide a framework for empirically analyzing the leakage of such protocols, showing that in some contexts knowing the hash prefixes leads to a 12x increase in the efficacy of remote guessing attacks. We propose two new protocols that provide stronger protection for users' passwords, implement them, and show experimentally that they remain practical to deploy.
Lucy Li, Bijeeta Pal, Junade Ali, Nick Sullivan, Rahul Chatterjee 0001, Thomas Ristenpart
CCS1