| Publication | Date of Publication | Type |
|---|
| Compressing unit-vector correlations via sparse pseudorandom generators | 2024-12-13 | Paper |
| On low-end obfuscation and learning | 2024-09-25 | Paper |
| Locally verifiable distributed SNARGs | 2024-08-01 | Paper |
| Information-theoretic distributed point functions | 2024-06-25 | Paper |
scientific article; zbMATH DE number 7829259 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Breaking the O(√ n)-Bit Barrier
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Arithmetic sketching
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Sublinear-communication secure multiparty computation does not require FHE
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
Journal of Cryptology | 2023-11-21 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions
Journal of Cryptology | 2023-10-25 | Paper |
Sublinear secure computation from new assumptions
Theory of Cryptography | 2023-08-14 | Paper |
Programmable distributed point functions
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Must the communication graph of MPC protocols be an expander?
Journal of Cryptology | 2023-07-05 | 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 Information Loss. | 2023-02-03 | Paper |
| Efficient pseudorandom correlation generators from ring-LPN | 2022-11-09 | Paper |
| Secure multiparty computation with sublinear preprocessing | 2022-08-30 | Paper |
| Adversarially robust property-preserving hash functions | 2022-07-18 | Paper |
| Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] | 2022-05-18 | Paper |
| Sublinear GMW-style compiler for MPC with preprocessing | 2022-04-22 | Paper |
| Topology-hiding communication from minimal assumptions | 2022-03-23 | Paper |
| Function secret sharing for mixed-mode and fixed-point secure computation | 2021-12-08 | Paper |
| The bottleneck complexity of secure multiparty computation | 2021-07-28 | Paper |
| Foundations of homomorphic secret sharing | 2021-06-15 | Paper |
| Must the communication graph of MPC protocols be an expander? | 2020-06-30 | Paper |
| Limits of practical sublinear secure computation | 2020-06-30 | Paper |
| Permuted puzzles and cryptographic hardness | 2020-04-30 | Paper |
| Secure computation with preprocessing via function secret sharing | 2020-04-30 | Paper |
| Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
| Zero-knowledge proofs on secret-shared data via fully linear PCPs | 2020-03-09 | Paper |
| Efficient pseudorandom correlation generators: silent OT extension and more | 2020-03-09 | Paper |
| Homomorphic secret sharing from lattices without FHE | 2020-02-06 | Paper |
| Securing Abe's mix-net against malicious verifiers via witness indistinguishability | 2018-10-17 | Paper |
| Exploring the boundaries of topology-hiding computation | 2018-07-17 | Paper |
| Recent advances in function and homomorphic secret sharing (invited talk) | 2018-04-26 | Paper |
| Can we access a database both locally and privately? | 2018-01-19 | Paper |
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Breaking the circuit size barrier for secure computation under DDH
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Is there an oblivious RAM lower bound?
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Oblivious parallel RAM and applications
Theory of Cryptography | 2016-04-08 | Paper |
Limits of extractability assumptions with distributional auxiliary input
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Function secret sharing
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Leakage-resilient coin tossing
Distributed Computing | 2014-07-11 | Paper |
Multiparty computation secure against continual memory leakage
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Functional signatures and pseudorandom functions
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
On extractability obfuscation
Theory of Cryptography | 2014-02-18 | Paper |
Secure computation against adaptive auxiliary information
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Fully leakage-resilient signatures
Journal of Cryptology | 2013-08-01 | Paper |
Communication Locality in Secure Multi-party Computation
Theory of Cryptography | 2013-03-18 | Paper |
Leakage-Resilient Coin Tossing
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Fully Leakage-Resilient Signatures
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Sequential entry in many-to-one matching markets
Social Choice and Welfare | 2009-10-19 | Paper |
