| Publication | Date of Publication | Type |
|---|
| Sum-check protocol for approximate computations | 2026-07-29 | Paper |
| Non-interactive secure computation with constant communication overhead | 2026-07-20 | Paper |
| Breaking the \(O(n^{1/(2k-1)})\) barrier for information-theoretic private information retrieval | 2026-05-29 | Paper |
| Cryptography in \(\mathrm{NC}^0\) | 2026-05-29 | Paper |
| Cryptography from anonymity | 2026-05-29 | Paper |
| Randomizing polynomials: a new representation with applications to round-efficient secure computation | 2026-05-08 | Paper |
| Cryptography with weak privacy | 2026-04-24 | Paper |
| Designated-verifier SNARGs with one group element | 2026-02-06 | Paper |
| A unified framework for succinct garbling from homomorphic secret sharing | 2026-02-04 | Paper |
| Fully anonymous secret sharing | 2026-02-04 | Paper |
| Information-theoretic single-server PIR in the shuffle model | 2026-02-03 | Paper |
| Peeking into the future: MPC resilient to super-rushing adversaries | 2025-12-02 | Paper |
| Zero-knowledge RAM: doubly efficient and black-box | 2025-12-02 | Paper |
| Query-reusable proof systems | 2025-12-02 | Paper |
| Correlated pseudorandom functions from variable-density LPN | 2025-08-12 | Paper |
| Proximity gaps for Reed-Solomon codes | 2025-08-12 | Paper |
| Bounded-communication leakage resilience via parity-resilient circuits | 2025-08-06 | Paper |
| Bounded simultaneous messages | 2025-07-28 | Paper |
Proximity gaps for Reed-Solomon codes
Journal of the ACM | 2025-02-05 | Paper |
| Compressing unit-vector correlations via sparse pseudorandom generators | 2024-12-13 | Paper |
| PIR with client-side preprocessing: information-theoretic constructions and lower bounds | 2024-12-13 | Paper |
| Leakage-tolerant circuits | 2024-11-13 | Paper |
| Constant-round simulation-secure coin tossing extension with guaranteed output | 2024-11-13 | Paper |
| On low-end obfuscation and learning | 2024-09-25 | Paper |
| Combinatorially homomorphic encryption | 2024-08-02 | Paper |
| Cryptography from planted graphs: security with logarithmic-size messages | 2024-08-01 | Paper |
Limits of preprocessing
Computational Complexity | 2024-08-01 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
| Information-theoretic distributed point functions | 2024-06-25 | Paper |
| Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness | 2024-05-08 | Paper |
| Succinct computational secret sharing | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829258 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829259 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829303 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Computational wiretap coding from indistinguishability obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Succinct arguments for RAM programs via projection codes
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Arithmetic sketching
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Additive randomized encodings and their applications
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Perfect MPC over layered graphs
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Round-optimal black-box MPC in the plain model
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
One-message secure reductions: on the cost of converting correlations
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Black-box reusable NISC with random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
Journal of Cryptology | 2023-11-21 | Paper |
Ligero: lightweight sublinear arguments without a trusted setup
Designs, Codes and Cryptography | 2023-11-07 | Paper |
Round-optimal black-box secure computation from two-round malicious OT
Theory of Cryptography | 2023-08-14 | Paper |
Fully-secure MPC with minimal trust
Theory of Cryptography | 2023-08-14 | Paper |
Actively secure garbled circuits with constant communication overhead in the plain model
Journal of Cryptology | 2023-07-26 | Paper |
Streaming and unbalanced PSI from function secret sharing
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Authenticated garbling from simple correlations
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Programmable distributed point functions
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Quadratic multiparty randomized encodings beyond honest majority and their applications
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Tight bounds on the randomness complexity of secure multiparty computation
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
| scientific article; zbMATH DE number 7706037 (Why is no real title available?) | 2023-07-03 | Paper |
Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation | 2023-04-13 | Paper |
| Efficient fully secure computation via distributed zero-knowledge proofs | 2023-03-29 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
| Separating two-round secure computation from oblivious transfer | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650430 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650434 (Why is no real title available?) | 2023-02-03 | Paper |
| On succinct arguments and witness encryption from groups | 2022-11-09 | Paper |
| Efficient pseudorandom correlation generators from ring-LPN | 2022-11-09 | Paper |
| Round-optimal black-box protocol compilers | 2022-08-30 | Paper |
| Asymptotically quasi-optimal cryptography | 2022-08-30 | Paper |
| Secure multiparty computation with sublinear preprocessing | 2022-08-30 | Paper |
| Private circuits with quasilinear randomness | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7561745 (Why is no real title available?) | 2022-07-21 | Paper |
| Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) | 2022-05-18 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Journal of Cryptology | 2022-05-10 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| On the round complexity of black-box secure MPC | 2022-04-22 | Paper |
| Sublinear GMW-style compiler for MPC with preprocessing | 2022-04-22 | Paper |
| On pseudorandom encodings | 2022-03-23 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage''
Journal of Cryptology | 2022-03-03 | Paper |
| A geometric approach to homomorphic secret sharing | 2021-12-21 | Paper |
| Function secret sharing for mixed-mode and fixed-point secure computation | 2021-12-08 | Paper |
| On computational shortcuts for information-theoretic PIR | 2021-12-01 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage''
Journal of Cryptology | 2021-11-24 | Paper |
Unconditionally secure computation against low-complexity leakage
Journal of Cryptology | 2021-09-10 | Paper |
On the local leakage resilience of linear secret sharing schemes
Journal of Cryptology | 2021-06-28 | Paper |
| Foundations of homomorphic secret sharing | 2021-06-15 | Paper |
| Limits of practical sublinear secure computation | 2020-06-30 | Paper |
| Private circuits: a modular approach | 2020-06-30 | Paper |
| On fully secure MPC with solitary output | 2020-04-30 | Paper |
| Secure computation with preprocessing via function secret sharing | 2020-04-30 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Zero-knowledge proofs on secret-shared data via fully linear PCPs | 2020-03-09 | Paper |
| Reusable non-interactive secure computation | 2020-03-09 | Paper |
| Efficient pseudorandom correlation generators: silent OT extension and more | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
Unconditionally secure computation against low-complexity leakage
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
| Two-round MPC: information-theoretic and black-box | 2018-12-11 | Paper |
| Best possible information-theoretic MPC | 2018-12-06 | Paper |
| Exploring crypto dark matter: new simple PRF candidates and their applications | 2018-12-06 | Paper |
On the local leakage resilience of linear secret sharing schemes
Lecture Notes in Computer Science | 2018-09-12 | Paper |
| Quasi-optimal SNARGs via linear multi-prover interactive proofs | 2018-07-17 | Paper |
| On the message complexity of secure multiparty computation | 2018-05-16 | Paper |
