14 citations · 29 across the 8 of their papers we have counts for
8 papers
Does Prompt-Tuning Language Model Ensure Privacy?
Shangyu Xie, Wei Dai, Esha Ghosh +3
Prompt-tuning has received attention as an efficient tuning method in the language domain, i.e., tuning a prompt that is a few tokens long, while keeping the large language model f…
Verifiable and Provably Secure Machine Unlearning
Thorsten Eisenhofer, Doreen Riepel, Varun Chandrasekaran +3
Machine unlearning aims to remove points from the training dataset of a machine learning model after training: e.g., when a user requests their data to be deleted. While many unlea…
Combing for Credentials: Active Pattern Extraction from Smart Reply
Bargav Jayaraman, Esha Ghosh, Melissa Chase +3
Pre-trained large language models, such as GPT\nobreakdash-2 and BERT, are often fine-tuned to achieve state-of-the-art performance on a downstream task. One natural example is the…
Membership Inference on Word Embedding and Beyond
Saeed Mahloujifar, Huseyin A. Inan, Melissa Chase +2
In the text processing context, most ML models are built on word embeddings. These embeddings are themselves trained on some datasets, potentially containing sensitive data. In som…
Property Inference From Poisoning
Melissa Chase, Esha Ghosh, Saeed Mahloujifar
Property inference attacks consider an adversary who has access to the trained model and tries to extract some global statistics of the training data. In this work, we study proper…
Verifiable Member and Order Queries on a List in Zero-Knowledge
Esha Ghosh, Olga Ohrimenko, Roberto Tamassia
We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated…
Verifiable Privacy-Preserving Member and Order Queries on a List
Esha Ghosh, Olga Ohrimenko, Roberto Tamassia
We introduce a formal model for membership and order queries on privacy-preserving authenticated lists. In this model, the queries are performed on the list stored in the cloud whe…
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Esha Ghosh, Subhas K. Ghosh, C. Pandu Rangan
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network whe…