Paul Bunn

dblp:25/5647 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
1since 2021 · last 2023
0000-0002-7393-2883ORCID · reported

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

Security and privacy · 5 · 3 first-author · 1 since 2021Theory of computation · 3 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2023 Anonymous Permutation Routing
Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky
TCC (3)1
2020 Oblivious Sampling with Applications to Two-Party k-Means Clustering
Paul Bunn, Rafail Ostrovsky
J. Cryptol.1
2014 Authenticated Adversarial Routing
Yair Amir, Paul Bunn, Rafail Ostrovsky
J. Cryptol.2
2013 Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary
Paul Bunn, Rafail Ostrovsky
DISC1
2010 Asynchronous Throughput-Optimal Routing in Malicious Networks
Paul Bunn, Rafail Ostrovsky
ICALP (2)1
2009 Authenticated Adversarial Routing
Yair Amir, Paul Bunn, Rafail Ostrovsky
TCC2
2007 Secure two-party k-means clustering
abstract
The k-Means Clustering problem is one of the most-explored problems in data mining to date. With the advent of protocols that have proven to be successful in performing single database clustering, the focus has shifted in recent years to the question of how to extend the single database protocols to a multiple database setting. To date there have been numerous attempts to create specific multiparty k-means clustering protocols that protect the privacy of each database, but according to the standard cryptographic definitions of "privacy-protection," so far all such attempts have fallen short of providing adequate privacy.
Paul Bunn, Rafail Ostrovsky
CCS1