Paul Bunn

According to our database, Paul Bunn authored at least 13 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Anonymous Permutation Routing.

Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2022

Secure Merge in Linear Time and O(log log N) Rounds.

Mark Blunk, Paul Bunn, Samuel Dittmer, Steve Lu, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2022

2021

CNF-FSS and its Applications.

Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2021

2020

Oblivious Sampling with Applications to Two-Party k-Means Clustering.

Paul Bunn, Rafail Ostrovsky

J. Cryptol., 2020

2018

Efficient 3-Party Distributed ORAM.

Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2018

2014

Authenticated Adversarial Routing.

Yair Amir, Paul Bunn, Rafail Ostrovsky

J. Cryptol., 2014

2013

Secure End-to-End Communication with Optimal Throughput in Unreliable Networks

Paul Bunn, Rafail Ostrovsky

CoRR, 2013

Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary.

Paul Bunn, Rafail Ostrovsky

Proceedings of the Distributed Computing - 27th International Symposium, 2013

2010

Throughput-Optimal Routing in Unreliable Networks.

Paul Bunn, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2010

Asynchronous Throughput-Optimal Routing in Malicious Networks.

Paul Bunn, Rafail Ostrovsky

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Throughput in Asynchronous Networks

Paul Bunn, Rafail Ostrovsky

CoRR, 2009

2008

Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting

Yair Amir, Paul Bunn, Rafail Ostrovsky

CoRR, 2008

2007

Secure Two-Party k-Means Clustering.

Paul Bunn, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2007