Paul Bunn

Orcid: 0000-0002-7393-2883

According to our database1, Paul Bunn authored at least 14 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Linear-Time Secure Merge in O(loglog n) Rounds.
Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2023
Anonymous Permutation Routing.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Secure Merge in Linear Time and O(log log N) Rounds.
IACR Cryptol. ePrint Arch., 2022

CNF-FSS and Its Applications.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

2020
Oblivious Sampling with Applications to Two-Party k-Means Clustering.
J. Cryptol., 2020

Efficient 3-Party Distributed ORAM.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

2013
Secure End-to-End Communication with Optimal Throughput in Unreliable Networks
CoRR, 2013

Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

2010
Throughput-Optimal Routing in Unreliable Networks.
IACR Cryptol. ePrint Arch., 2010

Asynchronous Throughput-Optimal Routing in Malicious Networks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Throughput in Asynchronous Networks
CoRR, 2009

Authenticated Adversarial Routing.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

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

2007
Secure two-party k-means clustering.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007


  Loading...