Jiayu Xu

Orcid: 0000-0002-0881-9980

Affiliations:
  • Oregon State University, School of Electrical Engineering and Computer Science, Corvallis, OR, USA
  • University of California, Irvine, CA, USA (PhD 2019)
  • Algorand Inc., Boston, MA, USA
  • George Mason University, Department of Computer Science, Fairfax, USA
  • University of Maryland, Department of Computer Science, MA, USA


According to our database1, Jiayu Xu authored at least 29 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
UC-Security of Encrypted Key Exchange: A Tutorial.
IACR Cryptol. ePrint Arch., 2025

How to Tolerate Typos in Strong Asymmetric PAKE.
IACR Cryptol. ePrint Arch., 2025

2024
Fuzzy PSI via Oblivious Protocol Routing.
IACR Cryptol. ePrint Arch., 2024

A Complete Characterization of One-More Assumptions In the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2024

Under What Conditions Is Encrypted Key Exchange Actually Secure?
IACR Cryptol. ePrint Arch., 2024

Threshold PAKE with Security against Compromise of all Servers.
IACR Cryptol. ePrint Arch., 2024

Password-Protected Threshold Signatures.
IACR Cryptol. ePrint Arch., 2024

Unforgeability of Blind Schnorr in the Limited Concurrency Setting.
IACR Commun. Cryptol., 2024

2023
Classical and Quantum Security of Elliptic Curve VRF, via Relative Indifferentiability.
IACR Cryptol. ePrint Arch., 2023

An Efficient Strong Asymmetric PAKE Compiler Instantiable from Group Actions.
IACR Cryptol. ePrint Arch., 2023

On the Non-Malleability of ECVRF in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2023

2022
A Universally Composable PAKE with Zero Communication Cost (And Why It Shouldn't Be Considered UC-Secure).
IACR Cryptol. ePrint Arch., 2022

How to Obfuscate MPC Inputs.
IACR Cryptol. ePrint Arch., 2022

The Abe-Okamoto Partially Blind Signature Scheme Revisited.
IACR Cryptol. ePrint Arch., 2022

On Pairing-Free Blind Signature Schemes in the Algebraic Group Model.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

2021
On the (In)Security of the Diffie-Hellman Oblivious PRF with Multiplicative Blinding.
IACR Cryptol. ePrint Arch., 2021

Spreading the Privacy Blanket: Differentially Oblivious Shuffling for Differential Privacy.
IACR Cryptol. ePrint Arch., 2021

Algebraic Adversaries in the Universal Composability Framework.
IACR Cryptol. ePrint Arch., 2021

2020
On the Security of Time-Locked Puzzles and Timed Commitments.
IACR Cryptol. ePrint Arch., 2020

On Pairing-Free Blind Signature Schemes in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2020

Universally Composable Relaxed Password Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2020

On the Security of Time-Lock Puzzles and Timed Commitments.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
Password-Based Cryptographic Protocols in the Client-Server Setting.
PhD thesis, 2019

Strong Asymmetric PAKE based on Trapdoor CKEM.
IACR Cryptol. ePrint Arch., 2019

Password-Authenticated Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2019

2018
OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-Computation Attacks.
IACR Cryptol. ePrint Arch., 2018

Round-Reduced Modular Construction of Asymmetric Password-Authenticated Key Exchange.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
TOPPSS: Cost-minimal Password-Protected Secret Sharing based on Threshold OPRF.
IACR Cryptol. ePrint Arch., 2017

2016
Highly-Efficient and Composable Password-Protected Secret Sharing (Or: How to Protect Your Bitcoin Wallet Online).
IACR Cryptol. ePrint Arch., 2016


  Loading...