| Publication | Date of Publication | Type |
|---|
| Pseudorandom correlation functions for garbled circuits | 2026-04-24 | Paper |
| Multiparty homomorphic secret sharing and more from LPN and MQ | 2026-04-24 | Paper |
| Fast pseudorandom correlation functions from sparse LPN | 2026-04-23 | Paper |
| Black-box uselessness: composing separations in cryptography | 2026-04-15 | Paper |
| (1/ )-rate Boolean garbling scheme from generic groups | 2026-02-04 | Paper |
| Breaking the 1/ -rate barrier for arithmetic garbling | 2025-12-02 | Paper |
| Enhanced trapdoor hashing from DDH and DCR | 2025-12-02 | Paper |
| Multi-key homomorphic secret sharing | 2025-12-02 | Paper |
Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
Cryptography and Communications | 2025-10-15 | Paper |
| Correlated pseudorandom functions from variable-density LPN | 2025-08-12 | Paper |
| On bounded storage key agreement and one-way functions | 2025-07-23 | Paper |
| A note on low-communication secure multiparty computation via circuit depth-reduction | 2025-07-23 | Paper |
| Faster signatures from MPC-in-the-head | 2025-07-23 | Paper |
| FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits | 2025-07-03 | Paper |
| QuietOT: lightweight oblivious transfer with a public-key setup | 2025-07-03 | Paper |
On building fine-grained one-way functions from strong average-case hardness
Journal of Cryptology | 2025-01-17 | Paper |
| Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs | 2025-01-10 | Paper |
An efficient ZK compiler from SIMD circuits to general circuits
Journal of Cryptology | 2024-12-27 | Paper |
| 10-party sublinear secure computation from standard assumptions | 2024-12-13 | Paper |
| Fine-grained non-interactive key exchange, revisited | 2024-12-04 | Paper |
| Fast public-key silent OT and more from constrained Naor-Reingold | 2024-11-13 | Paper |
Correlated pseudorandomness from the hardness of quasi-abelian decoding
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
A note on non-interactive zero-knowledge from CDH
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Fine-grained non-interactive key-exchange: constructions and lower bounds
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Constrained pseudorandom functions from homomorphic secret sharing
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Sublinear-communication secure multiparty computation does not require FHE
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Short signatures from regular syndrome decoding in the head
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Pseudorandom correlation functions from variable-density LPN, revisited
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Improved private set intersection for sets with small entries
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Random sources in private computation
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Non-interactive secure computation of inner-product from LPN and LWE
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Sublinear secure computation from new assumptions
Theory of Cryptography | 2023-08-14 | Paper |
Anonymous whistleblowing over authenticated channels
Theory of Cryptography | 2023-08-14 | Paper |
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Efficient NIZKs for algebraic sets
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| On derandomizing Yao's weak-to-strong OWF construction | 2023-04-13 | Paper |
| Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer | 2023-04-13 | Paper |
| Statistical ZAPs from group-based assumptions | 2023-03-31 | Paper |
| Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages | 2022-12-07 | Paper |
| Efficient pseudorandom correlation generators from ring-LPN | 2022-11-09 | Paper |
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| On building fine-grained one-way functions from strong average-case hardness | 2022-08-30 | Paper |
| Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) | 2022-05-18 | Paper |
| Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes | 2022-04-22 | Paper |
| On pseudorandom encodings | 2022-03-23 | Paper |
| Breaking the circuit size barrier for secure computation under quasi-polynomial LPN | 2021-12-08 | Paper |
| Efficient range proofs with transparent setup from bounded integer commitments | 2021-12-08 | Paper |
| Non-interactive zero-knowledge in pairing-free groups from weaker assumptions | 2021-12-01 | Paper |
| Efficient pseudorandom correlation generators: silent OT extension and more | 2020-03-09 | Paper |
| A note on the communication complexity of multiparty computation in the correlated randomness model | 2020-02-06 | Paper |
| Designated-verifier pseudorandom generators, and their applications | 2020-02-06 | Paper |
| Non-interactive keyed-verification anonymous credentials | 2020-01-28 | Paper |
| On the concrete security of Goldreich's pseudorandom generator | 2019-01-23 | Paper |
| New protocols for secure equality test and comparison | 2018-08-10 | Paper |
| Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge | 2018-07-17 | Paper |
Encryption switching protocols
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Implicit zero-knowledge arguments and applications to the malicious setting
Lecture Notes in Computer Science | 2015-12-10 | Paper |
