Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q6126253 | 2024-04-09 | Paper |
Breaking the O(√ n)-Bit Barrier | 2024-03-26 | Paper |
Arithmetic sketching | 2024-02-02 | Paper |
Oblivious transfer with constant computational overhead | 2024-01-16 | Paper |
Sublinear-communication secure multiparty computation does not require FHE | 2023-12-08 | Paper |
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party | 2023-11-21 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions | 2023-10-25 | Paper |
Sublinear secure computation from new assumptions | 2023-08-14 | Paper |
Programmable distributed point functions | 2023-07-07 | Paper |
Must the communication graph of MPC protocols be an expander? | 2023-07-05 | Paper |
Correlated pseudorandomness from expand-accumulate codes | 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 |
https://portal.mardi4nfdi.de/entity/Q5090388 | 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 |
https://portal.mardi4nfdi.de/entity/Q5002694 | 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 |
Secure computation with preprocessing via function secret sharing | 2020-04-30 | Paper |
Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
Permuted puzzles and cryptographic hardness | 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 | 2017-06-13 | Paper |
Breaking the Circuit Size Barrier for Secure Computation Under DDH | 2016-11-30 | Paper |
Is There an Oblivious RAM Lower Bound? | 2016-04-15 | Paper |
Oblivious Parallel RAM and Applications | 2016-04-08 | Paper |
Limits of Extractability Assumptions with Distributional Auxiliary Input | 2016-03-23 | Paper |
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs | 2015-12-10 | Paper |
Function Secret Sharing | 2015-09-30 | Paper |
Leakage-resilient coin tossing | 2014-07-11 | Paper |
Multiparty computation secure against continual memory leakage | 2014-05-13 | Paper |
Functional Signatures and Pseudorandom Functions | 2014-03-25 | Paper |
On Extractability Obfuscation | 2014-02-18 | Paper |
Secure Computation against Adaptive Auxiliary Information | 2013-09-02 | Paper |
Fully leakage-resilient signatures | 2013-08-01 | Paper |
Communication Locality in Secure Multi-party Computation | 2013-03-18 | Paper |
Leakage-Resilient Coin Tossing | 2011-10-28 | Paper |
Fully Leakage-Resilient Signatures | 2011-05-27 | Paper |
Sequential entry in many-to-one matching markets | 2009-10-19 | Paper |