| Publication | Date of Publication | Type |
|---|
| The round complexity of statistical MPC with optimal resiliency | 2024-05-08 | Paper |
| Succinct computational secret sharing | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126230 | 2024-04-09 | Paper |
| How to recover a secret with \(O(n)\) additions | 2024-02-02 | Paper |
| Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error | 2023-12-15 | Paper |
| Actively secure arithmetic computation and VOLE with constant computational overhead | 2023-12-08 | Paper |
| Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) | 2023-08-14 | Paper |
| Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) | 2023-07-07 | Paper |
| Quadratic multiparty randomized encodings beyond honest majority and their applications | 2023-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6107253 | 2023-07-03 | Paper |
| Correction to: ``Locally computable UOWHF with linear shrinkage | 2023-04-13 | Paper |
| On actively-secure elementary MPC reductions | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875778 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090374 | 2022-07-18 | Paper |
| Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) | 2022-04-22 | Paper |
| The resiliency of MPC with low interaction: the benefit of making errors (extended abstract) | 2022-03-23 | Paper |
| On the Power of Amortization in Secret Sharing | 2022-03-07 | Paper |
| Garbled Circuits as Randomized Encodings of Functions: a Primer | 2022-01-12 | Paper |
| Obfuscating circuits via composite-order graded encoding | 2021-07-02 | Paper |
| Placing conditional disclosure of secrets in the communication complexity universe | 2021-06-28 | Paper |
| Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations | 2021-02-08 | Paper |
| Perfect Secure Computation in Two Rounds | 2021-02-08 | Paper |
| Better secret sharing via robust conditional disclosure of secrets | 2021-01-19 | Paper |
| The communication complexity of private simultaneous messages, revisited | 2020-06-15 | Paper |
| Degree 2 is complete for the round-complexity of malicious MPC | 2020-02-06 | Paper |
| Secret-sharing schemes for general and uniform access structures | 2020-02-04 | Paper |
| On the relationship between statistical zero-knowledge and statistical randomized encodings | 2019-12-19 | Paper |
| Perfect secure computation in two rounds | 2018-12-11 | Paper |
| On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate | 2018-12-11 | Paper |
| The communication complexity of private simultaneous messages, revisited | 2018-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568110 | 2018-06-15 | Paper |
| Arithmetic Cryptography | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638056 | 2018-05-03 | Paper |
| Minimizing locality of one-way functions via semi-private randomized encodings | 2018-04-26 | Paper |
| From private simultaneous messages to zero-information Arthur-Merlin protocols and back | 2018-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601848 | 2018-01-24 | Paper |
| Algebraic Attacks against Random Local Functions and Their Countermeasures | 2018-01-12 | Paper |
| Clique Here: On the Distributed Complexity in Fully-Connected Networks | 2017-12-15 | Paper |
| Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations | 2017-11-03 | Paper |
| Locally computable UOWHF with linear shrinkage | 2017-10-12 | Paper |
| Algebraic attacks against random local functions and their countermeasures | 2017-09-29 | Paper |
| Deterministic Rateless Codes for BSC | 2017-05-19 | Paper |
| Arithmetic Cryptography | 2017-05-19 | Paper |
| Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys | 2017-01-13 | Paper |
| Fast Pseudorandom Functions Based on Expander Graphs | 2016-12-21 | Paper |
| On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings | 2016-11-09 | Paper |
| Cryptographic hardness of random local functions. Survey | 2016-10-28 | Paper |
| Garbling XOR gates ``for free in the standard model | 2016-09-21 | Paper |
| A dichotomy for local small-bias generators | 2016-09-21 | Paper |
| Incompressible functions, relative-error extractors, and the power of nondeterministic reductions | 2016-06-30 | Paper |
| From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back | 2016-04-08 | Paper |
| Obfuscating Circuits via Composite-Order Graded Encoding | 2015-07-06 | Paper |
| Bootstrapping Obfuscators via Fast Pseudorandom Functions | 2015-01-06 | Paper |
| Key-dependent message security: generic amplification and completeness | 2014-09-25 | Paper |
| Public-key cryptography from different assumptions | 2014-08-13 | Paper |
| How to Garble Arithmetic Circuits | 2014-07-30 | Paper |
| How to Garble Arithmetic Circuits | 2014-07-30 | Paper |
| Pseudorandom generators with long stretch and low locality from random local one-way functions | 2014-05-13 | Paper |
| Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions | 2014-02-04 | Paper |
| Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys | 2013-09-17 | Paper |
| Locally Computable UOWHF with Linear Shrinkage | 2013-05-31 | Paper |
| Garbling XOR Gates “For Free” in the Standard Model | 2013-03-18 | Paper |
| Cryptographic Hardness of Random Local Functions–Survey | 2013-03-18 | Paper |
| A Dichotomy for Local Small-Bias Generators | 2012-06-15 | Paper |
| Key-Dependent Message Security: Generic Amplification and Completeness | 2011-05-27 | Paper |
| Randomly Encoding Functions: A New Cryptographic Paradigm | 2011-05-19 | Paper |
| Cryptography in constant parallel time | 2011-02-14 | Paper |
| From Secrecy to Soundness: Efficient Verification via Secure Computation | 2010-09-07 | Paper |
| Cryptography with constant input locality | 2009-11-13 | Paper |
| Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems | 2009-10-20 | Paper |
| Cryptography with Constant Input Locality | 2009-03-10 | Paper |
| On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) | 2008-08-20 | Paper |
| Computationally private randomizing polynomials and their applications | 2007-11-05 | Paper |
| Cryptography in $NC^0$ | 2007-09-07 | Paper |
| On Pseudorandom Generators with Linear Stretch in NC0 | 2007-08-28 | Paper |
