| Publication | Date of Publication | Type |
|---|
| Anonymous permutation routing | 2024-08-02 | Paper |
| Cryptography from planted graphs: security with logarithmic-size messages | 2024-08-01 | 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 |
| Additive randomized encodings and their applications | 2024-02-02 | Paper |
| Perfect MPC over layered graphs | 2024-02-02 | Paper |
| Random-index oblivious RAM | 2023-08-14 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
| Two-party direct-sum questions through the lens of multiparty communication complexity | 2023-02-03 | Paper |
| Efficient 3-party distributed ORAM | 2022-12-16 | Paper |
| CNF-FSS and Its Applications | 2022-07-08 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND | 2021-03-30 | Paper |
| On fully secure MPC with solitary output | 2020-04-30 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Sub-logarithmic distributed oblivious RAM with small block size | 2020-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743385 | 2019-05-10 | Paper |
| Best possible information-theoretic MPC | 2018-12-06 | Paper |
| The complexity of multiparty PSM protocols and related models | 2018-07-09 | 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 |
| An Ω(D log(N/D)) lower bound for broadcast in radio networks | 2017-09-29 | Paper |
| Randomness vs. fault-tolerance | 2017-09-29 | Paper |
| Randomized mutual exclusion algorithms revisited | 2017-08-21 | Paper |
| Ad Hoc PSM Protocols: Secure Computation Without Coordination | 2017-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957881 | 2017-01-30 | Paper |
| Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys | 2017-01-13 | Paper |
| Secure Protocol Transformations | 2016-10-27 | Paper |
| From randomizing polynomials to parallel algorithms | 2016-10-07 | Paper |
| Improved upper bounds on information-theoretic private information retrieval (extended abstract) | 2016-09-29 | Paper |
| One-way functions are essential for single-server private information retrieval | 2016-09-29 | Paper |
| Learning unions of high-dimensional boxes over the reals | 2016-06-16 | Paper |
| Secure multiparty computation with general interaction patterns | 2016-04-15 | Paper |
| Distribution design | 2016-04-15 | Paper |
| Private Large-Scale Databases with Distributed Searchable Symmetric Encryption | 2016-04-08 | Paper |
| Amortizing randomness in private multiparty computations | 2016-03-02 | Paper |
| Secure Computation with Minimal Interaction, Revisited | 2015-12-10 | Paper |
| Cryptography with One-Way Communication | 2015-12-10 | Paper |
| Randomness in private computations | 2015-09-11 | Paper |
| Lower bounds for randomized mutual exclusion | 2015-05-07 | Paper |
| The round complexity of verifiable secret sharing and secure multicast | 2015-02-27 | Paper |
| Private approximation of NP-hard functions | 2015-02-27 | Paper |
| On the complexity of communication complexity | 2015-02-04 | Paper |
| Information-theoretically secure protocols and security under composition | 2014-11-25 | Paper |
| Black-box constructions for secure computation | 2014-11-25 | Paper |
| Choosing, agreeing, and eliminating in communication complexity | 2014-09-25 | Paper |
| Non-Interactive Secure Multiparty Computation | 2014-08-07 | Paper |
| How to Garble Arithmetic Circuits | 2014-07-30 | Paper |
| How to Garble Arithmetic Circuits | 2014-07-30 | Paper |
| The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection | 2014-07-25 | Paper |
| Extracting Correlations | 2014-07-25 | Paper |
| On the Cryptographic Complexity of the Worst Functions | 2014-02-18 | Paper |
| Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys | 2013-09-17 | Paper |
| Robust Pseudorandom Generators | 2013-08-06 | Paper |
| On the Power of Correlated Randomness in Secure Computation | 2013-03-18 | Paper |
| Constant-Rate Oblivious Transfer from Noisy Channels | 2011-08-12 | Paper |
| Black-Box Constructions of Protocols for Secure Computation | 2011-07-29 | Paper |
| Partition arguments in multiparty communication complexity | 2011-06-07 | Paper |
| Efficient Non-interactive Secure Computation | 2011-05-27 | Paper |
| On Achieving the “Best of Both Worlds” in Secure Multiparty Computation | 2011-05-17 | Paper |
| Information-Theoretically Secure Protocols and Security under Composition | 2010-11-04 | Paper |
| Choosing, Agreeing, and Eliminating in Communication Complexity | 2010-09-07 | Paper |
| From Secrecy to Soundness: Efficient Verification via Secure Computation | 2010-09-07 | Paper |
| Secure Multiparty Computation with Minimal Interaction | 2010-08-24 | Paper |
| Learning with attribute costs | 2010-08-16 | Paper |
| Batch codes and their applications | 2010-08-15 | Paper |
| Zero-Knowledge Proofs from Secure Multiparty Computation | 2010-07-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Cryptography with constant input locality | 2009-11-13 | Paper |
| Partition Arguments in Multiparty Communication Complexity | 2009-07-14 | Paper |
| How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? | 2009-03-10 | Paper |
| Public Key Encryption That Allows PIR Queries | 2009-03-10 | Paper |
| Cryptography with Constant Input Locality | 2009-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549728 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549593 | 2009-01-05 | Paper |
| Testing monotonicity over graph products | 2008-09-04 | Paper |
| On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) | 2008-08-20 | Paper |
| Distribution-Free Property-Testing | 2008-08-14 | Paper |
| Distribution-free connectivity testing for sparse graphs | 2008-05-27 | Paper |
| OT-Combiners via Secure Computation | 2008-03-05 | Paper |
| Computationally private randomizing polynomials and their applications | 2007-11-05 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Cryptography in $NC^0$ | 2007-09-07 | Paper |
| On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation | 2007-09-04 | Paper |
| On Pseudorandom Generators with Linear Stretch in NC0 | 2007-08-28 | Paper |
| On the limitations of universally composable two-party computation without set-up assumptions | 2006-08-14 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374903 | 2006-03-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Computation in Noisy Radio Networks | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| General constructions for information-theoretic private information retrieval | 2005-08-03 | Paper |
| Private information retrieval | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737161 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471371 | 2004-07-28 | Paper |
| Private computation using a PEZ dispenser. | 2004-03-14 | Paper |
| Amortizing Randomness in Private Multiparty Computations | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434869 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434901 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414264 | 2003-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409117 | 2003-06-30 | Paper |
| Learning functions represented as multiplicity automata | 2003-06-25 | Paper |
| PAC learning with nasty noise. | 2003-01-21 | Paper |
| The query complexity of finding local minima in the lattice | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2724430 | 2002-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542532 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542554 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542584 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526997 | 2001-02-28 | Paper |
| Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces | 2000-10-18 | Paper |
| Protecting data privacy in private information retrieval schemes | 2000-08-27 | Paper |
| Adaptive packet routing for bursty adversarial traffic | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955313 | 2000-07-24 | Paper |
| Computing Functions of a Shared Secret | 2000-07-20 | Paper |
| Randomness versus fault-tolerance | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231909 | 2000-04-26 | Paper |
| Reducibility and Completeness in Private Computations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249322 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940712 | 2000-03-01 | Paper |
| The linear-array conjecture in communication complexity is false | 1999-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228509 | 1999-10-04 | Paper |
| Characterizing linear size circuits in terms of privacy | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234105 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249630 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250187 | 1999-06-17 | Paper |
| Learning boxes in high dimension | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228448 | 1999-05-18 | Paper |
| Log-Space Polynomial End-to-End Communication | 1998-09-21 | Paper |
| Lower Bounds for Randomized Mutual Exclusion | 1998-09-21 | Paper |
| On Learning Read-k-Satisfy-j DNF | 1998-09-21 | Paper |
| A simple algorithm for learning O(log n)-term DNF | 1998-07-23 | Paper |
| A Randomness-Rounds Tradeoff in Private Computation | 1998-05-11 | Paper |
| An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks | 1998-05-10 | Paper |
| Randomness in Private Computations | 1998-02-09 | Paper |
| Online learning versus offline learning | 1997-12-17 | Paper |
| On learning visual concepts and DNF formulae | 1996-11-04 | Paper |
| Communication Complexity | 1996-04-24 | Paper |
| Witness sets for families of binary vectors | 1996-02-26 | Paper |
| Amortized Communication Complexity | 1996-01-28 | Paper |
| Fractional Covers and Communication Complexity | 1995-07-10 | Paper |
| Learning by distances | 1995-07-10 | Paper |
| Private Computations over the Integers | 1995-06-27 | Paper |
| On Lotteries with Unique Winners | 1995-05-04 | Paper |
| Learning Decision Trees Using the Fourier Spectrum | 1994-11-24 | Paper |
| Privacy, additional information and communication | 1994-10-26 | Paper |
| On the structure of the privacy hierarchy | 1994-05-26 | Paper |
| Secret sharing over infinite domains | 1993-08-29 | Paper |
| A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm | 1993-08-29 | Paper |
| A communication-privacy tradeoff for modular addition | 1993-05-16 | Paper |
| Privacy and Communication Complexity | 1992-09-27 | Paper |
| A Zero-One Law for Boolean Privacy | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750402 | 1990-01-01 | Paper |
