Alex Davidson

Orcid: 0000-0001-9157-3821

According to our database1, Alex Davidson authored at least 27 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Privacy Pass Issuance Protocols.
RFC, June, 2024

The Privacy Pass Architecture.
RFC, June, 2024

Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword Queries.
IACR Cryptol. ePrint Arch., 2024

Crypto Dark Matter on the Torus - Oblivious PRFs from Shallow PRFs and TFHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Oblivious Pseudorandom Functions (OPRFs) Using Prime-Order Groups.
RFC, December, 2023

FrodoPIR: Simple, Scalable, Single-Server Private Information Retrieval.
Proc. Priv. Enhancing Technol., January, 2023

DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing More.
IACR Cryptol. ePrint Arch., 2023

Crypto Dark Matter on the Torus: Oblivious PRFs from shallow PRFs and FHE.
IACR Cryptol. ePrint Arch., 2023

2022
Tango or Square Dance? How Tightly Should we Integrate Network Functionality in Browsers?
CoRR, 2022

A Framework for Building Secure, Scalable, Networked Enclaves.
CoRR, 2022

Let The Right One In: Attestation as a Usable CAPTCHA Alternative.
Proceedings of the Eighteenth Symposium on Usable Privacy and Security, 2022

Tango or square dance?: how tightly should we integrate network functionality in browsers?
Proceedings of the 21st ACM Workshop on Hot Topics in Networks, 2022

STAR: Secret Sharing for Private Threshold Aggregation Reporting.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
STAR: Distributed Secret Sharing for Private Threshold Aggregation Reporting.
CoRR, 2021

PrivateFetch: Scalable Catalog Delivery in Privacy-Preserving Advertising.
CoRR, 2021

2020
Adaptively Secure Constrained Pseudorandom Functions in the Standard Model.
IACR Cryptol. ePrint Arch., 2020

2019
Strong Post-Compromise Secure Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2019

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices.
IACR Cryptol. ePrint Arch., 2019

2018
Privacy Pass: Bypassing Internet Challenges Anonymously.
Proc. Priv. Enhancing Technol., 2018

A Bit-fixing PRF with O(1) Collusion-Resistance from LWE.
IACR Cryptol. ePrint Arch., 2018

Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance.
IACR Cryptol. ePrint Arch., 2018

Estimate all the {LWE, NTRU} schemes!
IACR Cryptol. ePrint Arch., 2018

2017
Notes On GGH13 Without The Presence Of Ideals.
IACR Cryptol. ePrint Arch., 2017

Notes on GGH13 Without the Presence of Ideals.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

An Efficient Toolkit for Computing Private Set Operations.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
Computing Private Set Operations with Linear Complexities.
IACR Cryptol. ePrint Arch., 2016

A Model for Secure and Mutually Beneficial Software Vulnerability Sharing.
Proceedings of the 2016 ACM on Workshop on Information Sharing and Collaborative Security, 2016


  Loading...