default search action
Paul Bunn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. TCC (3) 2023: 33-61 - 2022
- [c6]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and Its Applications. Public Key Cryptography (1) 2022: 283-314 - [i10]Mark Blunk, Paul Bunn, Samuel Dittmer, Steve Lu, Rafail Ostrovsky:
Secure Merge in Linear Time and O(log log N) Rounds. IACR Cryptol. ePrint Arch. 2022: 590 (2022) - [i9]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. IACR Cryptol. ePrint Arch. 2022: 1353 (2022) - 2021
- [i8]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and its Applications. IACR Cryptol. ePrint Arch. 2021: 163 (2021) - 2020
- [j2]Paul Bunn, Rafail Ostrovsky:
Oblivious Sampling with Applications to Two-Party k-Means Clustering. J. Cryptol. 33(3): 1362-1403 (2020) - [c5]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. SCN 2020: 215-232
2010 – 2019
- 2018
- [i7]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. IACR Cryptol. ePrint Arch. 2018: 706 (2018) - 2014
- [j1]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. J. Cryptol. 27(4): 636-771 (2014) - 2013
- [c4]Paul Bunn, Rafail Ostrovsky:
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary. DISC 2013: 403-417 - [i6]Paul Bunn, Rafail Ostrovsky:
Secure End-to-End Communication with Optimal Throughput in Unreliable Networks. CoRR abs/1304.2454 (2013) - 2010
- [c3]Paul Bunn, Rafail Ostrovsky:
Asynchronous Throughput-Optimal Routing in Malicious Networks. ICALP (2) 2010: 236-248 - [i5]Paul Bunn, Rafail Ostrovsky:
Throughput-Optimal Routing in Unreliable Networks. IACR Cryptol. ePrint Arch. 2010: 231 (2010)
2000 – 2009
- 2009
- [c2]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. TCC 2009: 163-182 - [i4]Paul Bunn, Rafail Ostrovsky:
Throughput in Asynchronous Networks. CoRR abs/0910.4572 (2009) - 2008
- [i3]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting. CoRR abs/0808.0156 (2008) - [i2]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. IACR Cryptol. ePrint Arch. 2008: 448 (2008) - 2007
- [c1]Paul Bunn, Rafail Ostrovsky:
Secure two-party k-means clustering. CCS 2007: 486-497 - [i1]Paul Bunn, Rafail Ostrovsky:
Secure Two-Party k-Means Clustering. IACR Cryptol. ePrint Arch. 2007: 231 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: