26 citations · 46 across the 7 of their papers we have counts for
7 papers
Correcting Subverted Random Oracles
Alexander Russell, Qiang Tang, Moti Yung +2
The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting f…
Deception by Omission: Using Adversarial Missingness to Poison Causal Structure Learning
Deniz Koyuncu, Alex Gittens, Bülent Yener +1
Inference of causal structures from observational data is a key component of causal machine learning; in practice, this data may be incompletely observed. Prior work has demonstrat…
Privacy Guarantees of BLE Contact Tracing: A Case Study on COVIDWISE
Salman Ahmed, Ya Xiao, Taejoong +5
Google and Apple jointly introduced a digital contact tracing technology and an API called "exposure notification," to help health organizations and governments with contact tracin…
Differentially-Private "Draw and Discard" Machine Learning
Vasyl Pihur, Aleksandra Korolova, Frederick Liu +4
In this work, we propose a novel framework for privacy-preserving client-distributed machine learning. It is motivated by the desire to achieve differential privacy guarantees in t…
Sequential Aggregate Signatures with Short Public Keys without Random Oracles
Kwangsu Lee, Dong Hoon Lee, Moti Yung
The notion of aggregate signature has been motivated by applications and it enables any user to compress different signatures signed by different signers on different messages into…
Adaptive Concurrent Non-Malleability with Bare Public-Keys
Andrew C. Yao, Moti Yung, Yunlei Zhao
Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently in environments such as the Internet. In this work, we formulate CNM in the bare publi…