Ryan Henry

Orcid: 0000-0002-1142-4349

According to our database1, Ryan Henry authored at least 26 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

2023
Grotto: Screaming fast (2 + 1)-PC for ℤ<sub>2<sup>n</sup></sub> via (2, 2)-DPFs.
IACR Cryptol. ePrint Arch., 2023

Grotto: Screaming fast (2+1)-PC or ℤ2n via (2, 2)-DPFs.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation.
IACR Cryptol. ePrint Arch., 2022

A Proposal for Assisted Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2022

Relax the Non-Collusion Assumption for Multi-Server PIR.
CoRR, 2022

Sabre: Sender-Anonymous Messaging with Fast Audits.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
You May Also Like... Privacy: Recommendation Systems Meet PIR.
Proc. Priv. Enhancing Technol., 2021

2020
Toward a Secure Internet of Things: Directions for Research.
IEEE Secur. Priv., 2020

Where's Alice?: Applied Kid Crypto Meets Provable Security.
Proceedings of the WPES'20: Proceedings of the 19th Workshop on Privacy in the Electronic Society, 2020

2019
A Bit More Than a Bit Is More Than a Bit Better: Faster (essentially) optimal-rate many-server PIR.
Proc. Priv. Enhancing Technol., 2019

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

2018
Blockchain Access Privacy: Challenges and Directions.
IEEE Secur. Priv., 2018

17th Workshop on Privacy in the Electronic Society (WPES 2018).
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Computing Low-Weight Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2017

Querying for Queries: Indexes of Queries for Efficient and Expressive IT-PIR.
IACR Cryptol. ePrint Arch., 2017

Tutorial: Private Information Retrieval.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Polynomial Batch Codes for Efficient IT-PIR.
Proc. Priv. Enhancing Technol., 2016

2014
Efficient Zero-Knowledge Proofs and Applications.
PhD thesis, 2014

2013
Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting.
Proceedings of the 12th annual ACM Workshop on Privacy in the Electronic Society, 2013

One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries.
Proceedings of the 20th Annual Network and Distributed System Security Symposium, 2013

Batch Proofs of Partial Knowledge.
Proceedings of the Applied Cryptography and Network Security, 2013

2011
Extending Nymble-like Systems.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

Formalizing Anonymous Blacklisting Systems.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

Practical PIR for electronic commerce.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Making a Nymbler Nymble Using VERBS.
Proceedings of the Privacy Enhancing Technologies, 10th International Symposium, 2010


  Loading...