Two Levels are Better than One: Dishonest Majority MPC with $\widetilde{O}(|C|)$ Total Communication.
IACR Cryptol. ePrint Arch., 2024
Batch PIR and Labeled PSI with Oblivious Ciphertext Compression.
IACR Cryptol. ePrint Arch., 2024
DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning using Packed Secret Sharing.
IACR Cryptol. ePrint Arch., 2024
Interval Key-Encapsulation Mechanism.
IACR Cryptol. ePrint Arch., 2024
Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication.
IACR Cryptol. ePrint Arch., 2024
Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity.
IACR Commun. Cryptol., 2024
Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024
ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet.
IACR Cryptol. ePrint Arch., 2023
Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps.
IACR Cryptol. ePrint Arch., 2023
On Linear Communication Complexity for (Maximally) Fluid MPC.
IACR Cryptol. ePrint Arch., 2023
Towards Topology-Hiding Computation from Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2023
A More Complete Analysis of the Signal Double Ratchet Algorithm.
IACR Cryptol. ePrint Arch., 2022
On the Worst-Case Inefficiency of CGKA.
IACR Cryptol. ePrint Arch., 2022
Forward Secret Encrypted RAM: Lower Bounds and Applications.
IACR Cryptol. ePrint Arch., 2021
Multicast Key Agreement, Revisited.
IACR Cryptol. ePrint Arch., 2021
On the Price of Concurrency in Group Ratcheting Protocols.
IACR Cryptol. ePrint Arch., 2020
From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?
IACR Cryptol. ePrint Arch., 2020