default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyan Henry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i9]José Reis, Mehmet Ugurbil, Sameer Wagh, Ryan Henry, Miguel de Vega:
Wave Hello to Privacy: Efficient Mixed-Mode MPC using Wavelet Transforms. IACR Cryptol. ePrint Arch. 2025: 13 (2025)- 2024
- [c17]Tiantian Gong, Ryan Henry, Alexandros Psomas, Aniket Kate:
More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR. SP 2024: 4348-4366 - 2023
- [c16]Kyle Storrier
, Adithya Vadapalli, Allan Lyons, Ryan Henry:
Grotto: Screaming fast (2+1)-PC or ℤ2n via (2, 2)-DPFs. CCS 2023: 2143-2157 - [c15]Adithya Vadapalli, Ryan Henry, Ian Goldberg:
Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation. USENIX Security Symposium 2023: 3907-3924 - [i8]Kyle Storrier, Adithya Vadapalli, Allan Lyons, Ryan Henry:
Grotto: Screaming fast (2 + 1)-PC for ℤ2n via (2, 2)-DPFs. IACR Cryptol. ePrint Arch. 2023: 108 (2023) - 2022
- [c14]Adithya Vadapalli, Kyle Storrier, Ryan Henry:
Sabre: Sender-Anonymous Messaging with Fast Audits. SP 2022: 1953-1970 - [i7]Tiantian Gong, Ryan Henry, Alex Psomas, Aniket Kate:
Relax the Non-Collusion Assumption for Multi-Server PIR. CoRR abs/2201.07740 (2022) - [i6]Natnatee Dokmai, L. Jean Camp, Ryan Henry:
A Proposal for Assisted Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 1082 (2022) - [i5]Adithya Vadapalli, Ryan Henry, Ian Goldberg:
Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation. IACR Cryptol. ePrint Arch. 2022: 1747 (2022) - 2021
- [j5]Adithya Vadapalli, Fattaneh Bayatbabolghani, Ryan Henry:
You May Also Like... Privacy: Recommendation Systems Meet PIR. Proc. Priv. Enhancing Technol. 2021(4): 30-53 (2021) - 2020
- [j4]L. Jean Camp, Ryan Henry, Tadayoshi Kohno, Shrirang Mare, Steven A. Myers, Shwetak N. Patel, Joshua Streiff:
Toward a Secure Internet of Things: Directions for Research. IEEE Secur. Priv. 18(4): 28-37 (2020) - [c13]Ryan Henry, Alyssa Tory, Sophie Henry, Isabella Henry, Samantha Henry:
Where's Alice?: Applied Kid Crypto Meets Provable Security. WPES@CCS 2020: 117-121
2010 – 2019
- 2019
- [j3]Syed Mahbub Hafiz, Ryan Henry:
A Bit More Than a Bit Is More Than a Bit Better: Faster (essentially) optimal-rate many-server PIR. Proc. Priv. Enhancing Technol. 2019(4): 112-131 (2019) - [c12]William Black, Ryan Henry:
There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero. WPES@CCS 2019: 37-49 - [i4]William Black, Ryan Henry:
There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero. IACR Cryptol. ePrint Arch. 2019: 968 (2019) - 2018
- [j2]Ryan Henry, Amir Herzberg, Aniket Kate:
Blockchain Access Privacy: Challenges and Directions. IEEE Secur. Priv. 16(4): 38-45 (2018) - [c11]Aaron Johnson, Ryan Henry:
17th Workshop on Privacy in the Electronic Society (WPES 2018). CCS 2018: 2181-2182 - 2017
- [c10]Syed Mahbub Hafiz, Ryan Henry:
Querying for Queries: Indexes of Queries for Efficient and Expressive IT-PIR. CCS 2017: 1361-1373 - [c9]Ryan Henry:
Tutorial: Private Information Retrieval. CCS 2017: 2611-2612 - [c8]Bailey Kacsmar, Sarah Plosker, Ryan Henry:
Computing Low-Weight Discrete Logarithms. SAC 2017: 106-126 - [i3]Bailey Kacsmar, Sarah Plosker, Ryan Henry:
Computing Low-Weight Discrete Logarithms. IACR Cryptol. ePrint Arch. 2017: 720 (2017) - [i2]Syed Mahbub Hafiz, Ryan Henry:
Querying for Queries: Indexes of Queries for Efficient and Expressive IT-PIR. IACR Cryptol. ePrint Arch. 2017: 825 (2017) - 2016
- [j1]Ryan Henry:
Polynomial Batch Codes for Efficient IT-PIR. Proc. Priv. Enhancing Technol. 2016(4): 202-218 (2016) - [i1]Ryan Henry:
Polynomial Batch Codes for Efficient IT-PIR. IACR Cryptol. ePrint Arch. 2016: 598 (2016) - 2014
- [b1]Ryan Henry:
Efficient Zero-Knowledge Proofs and Applications. University of Waterloo, Ontario, Canada, 2014 - 2013
- [c7]Ryan Henry, Ian Goldberg:
Batch Proofs of Partial Knowledge. ACNS 2013: 502-517 - [c6]Ryan Henry, Yizhou Huang, Ian Goldberg:
One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries. NDSS 2013 - [c5]Ryan Henry, Ian Goldberg:
Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting. WPES 2013: 71-82 - 2011
- [c4]Ryan Henry, Femi G. Olumofin, Ian Goldberg:
Practical PIR for electronic commerce. CCS 2011: 677-690 - [c3]Ryan Henry, Ian Goldberg:
Formalizing Anonymous Blacklisting Systems. IEEE Symposium on Security and Privacy 2011: 81-95 - [c2]Ryan Henry, Ian Goldberg:
Extending Nymble-like Systems. IEEE Symposium on Security and Privacy 2011: 523-537 - 2010
- [c1]Ryan Henry, Kevin J. Henry, Ian Goldberg:
Making a Nymbler Nymble Using VERBS. Privacy Enhancing Technologies 2010: 111-129
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 2025-01-20 23:02 CET 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:
