Secure Two-Party k-Means Clustering. - Paul Bunn; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2007)

Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting - Yair Amir; Paul Bunn; Rafail Ostrovsky (CoRR, 2008)

Throughput in Asynchronous Networks - Paul Bunn; Rafail Ostrovsky (CoRR, 2009)

Asynchronous Throughput-Optimal Routing in Malicious Networks. - Paul Bunn; Rafail Ostrovsky (ICALP (2), 2010)

Throughput-Optimal Routing in Unreliable Networks. - Paul Bunn; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2010)

Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary. - Paul Bunn; Rafail Ostrovsky (DISC, 2013)

Secure End-to-End Communication with Optimal Throughput in Unreliable Networks - Paul Bunn; Rafail Ostrovsky (CoRR, 2013)

Authenticated Adversarial Routing. - Yair Amir; Paul Bunn; Rafail Ostrovsky (J. Cryptol., 2014)

Efficient 3-Party Distributed ORAM. - Paul Bunn; Jonathan Katz; Eyal Kushilevitz; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2018)

Oblivious Sampling with Applications to Two-Party k-Means Clustering. - Paul Bunn; Rafail Ostrovsky (J. Cryptol., 2020)

CNF-FSS and its Applications. - Paul Bunn; Eyal Kushilevitz; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2021)

Secure Merge in Linear Time and O(log log N) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Anonymous Permutation Routing. - Paul Bunn; Eyal Kushilevitz; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Linear-Time Secure Merge in O(loglog n) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (ITC, 2025)