| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126230 | 2024-04-09 | Paper |
| Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059374 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875525 | 2023-02-03 | Paper |
| Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling | 2022-08-12 | Paper |
| Linear Secret-Sharing Schemes for Forbidden Graph Access Structures | 2022-05-30 | Paper |
| Quadratic secret sharing and conditional disclosure of secrets | 2022-04-22 | Paper |
| On the round complexity of the shuffle model | 2022-03-23 | Paper |
| The share size of secret-sharing schemes for almost all access structures and graphs | 2022-03-23 | Paper |
| Evolving ramp secret sharing with a small gap | 2021-12-01 | Paper |
| Learning privately with labeled and unlabeled examples | 2021-02-01 | Paper |
| Better secret sharing via robust conditional disclosure of secrets | 2021-01-19 | Paper |
| \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds | 2020-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5214238 | 2020-02-07 | Paper |
| Secret-sharing schemes for general and uniform access structures | 2020-02-04 | Paper |
| Optimal linear multiparty conditional disclosure of secrets protocols | 2019-01-23 | Paper |
| Evolving ramp secret-sharing schemes | 2018-10-17 | Paper |
| The complexity of multiparty PSM protocols and related models | 2018-07-09 | Paper |
| Linear secret-sharing schemes for forbidden graph access structures | 2018-01-19 | Paper |
| Learning Privately with Labeled and Unlabeled Examples | 2017-10-05 | Paper |
| Secret Sharing and Non-Shannon Information Inequalities | 2017-07-12 | Paper |
| Ad Hoc PSM Protocols: Secure Computation Without Coordination | 2017-06-23 | Paper |
| Characterizing the sample complexity of private learners | 2017-05-16 | Paper |
| Secret Sharing Schemes for Dense Forbidden Graphs | 2016-10-21 | Paper |
| One-way functions are essential for single-server private information retrieval | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5741634 | 2016-07-29 | Paper |
| Learning unions of high-dimensional boxes over the reals | 2016-06-16 | Paper |
| Secret-sharing schemes for very dense graphs | 2016-06-01 | Paper |
| Distribution Design | 2016-04-15 | Paper |
| Efficient reliable communication over partially authenticated networks | 2015-09-04 | Paper |
| Protocols for multiparty coin toss with a dishonest majority | 2015-08-03 | Paper |
| Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions | 2015-07-06 | Paper |
| Private approximation of search problems | 2014-11-25 | Paper |
| Choosing, agreeing, and eliminating in communication complexity | 2014-09-25 | Paper |
| Non-Interactive Secure Multiparty Computation | 2014-08-07 | Paper |
| Bounds on the sample complexity for private learning and private data release | 2014-07-14 | Paper |
| On the Cryptographic Complexity of the Worst Functions | 2014-02-18 | Paper |
| Multi-linear Secret-Sharing Schemes | 2014-02-18 | Paper |
| Private Learning and Sanitization: Pure vs. Approximate Differential Privacy | 2013-10-04 | Paper |
| On private computation in incomplete networks | 2013-06-20 | Paper |
| Efficient reliable communication over partially authenticated networks | 2013-06-07 | Paper |
| Secret Sharing Schemes for Very Dense Graphs | 2012-09-25 | Paper |
| Communication-efficient distributed oblivious transfer | 2012-08-17 | Paper |
| 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds | 2011-08-12 | Paper |
| Secret-Sharing Schemes: A Survey | 2011-06-08 | Paper |
| Private approximation of clustering and vertex cover | 2011-02-18 | Paper |
| Choosing, Agreeing, and Eliminating in Communication Complexity | 2010-09-07 | Paper |
| Protocols for Multiparty Coin Toss with Dishonest Majority | 2010-08-24 | Paper |
| How should we solve search problems privately? | 2010-03-01 | Paper |
| Bounds on the Sample Complexity for Private Learning and Private Data Release | 2010-02-24 | Paper |
| Monotone circuits for monotone weighted threshold functions | 2009-12-18 | Paper |
| Private Approximation of Search Problems | 2009-11-06 | Paper |
| Approximate belief updating in max-2-connected Bayes networks is NP-hard | 2009-09-14 | Paper |
| Matrix columns allocation problems | 2009-05-28 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Characterizing Ideal Weighted Threshold Secret Sharing | 2009-03-16 | Paper |
| How Should We Solve Search Problems Privately? | 2009-03-10 | Paper |
| Secret Sharing and Non-Shannon Information Inequalities | 2009-03-03 | Paper |
| On Matroids and Nonideal Secret Sharing | 2009-02-24 | Paper |
| Distributed Private Data Analysis: Simultaneously Solving How and What | 2009-02-10 | Paper |
| Edge Eavesdropping Games | 2008-11-27 | Paper |
| On Linear Secret Sharing for Connectivity in Directed Graphs | 2008-11-20 | Paper |
| Matroids Can Be Far from Ideal Secret Sharing | 2008-03-05 | Paper |
| Weakly-Private Secret Sharing Schemes | 2007-08-30 | Paper |
| Private Approximation of Clustering and Vertex Cover | 2007-08-30 | Paper |
| Robust information-theoretic private information retrieval | 2007-08-20 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Separating the Power of Monotone Span Programs over Different Fields | 2005-09-16 | Paper |
| On the Power of Nonlinear Secret-Sharing | 2005-09-16 | Paper |
| General constructions for information-theoretic private information retrieval | 2005-08-03 | Paper |
| Reducing the servers' computation in private information retrieval: PIR with preprocessing | 2004-09-27 | Paper |
| Buses for anonymous message delivery | 2003-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414292 | 2003-07-24 | Paper |
| Learning functions represented as multiplicity automata | 2003-06-25 | Paper |
| The query complexity of finding local minima in the lattice | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536794 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535072 | 2002-06-12 | Paper |
| On arithmetic branching programs | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941849 | 2000-07-26 | Paper |
| Computing Functions of a Shared Secret | 2000-07-20 | Paper |
| Secret Sharing With Public Reconstruction | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258572 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252753 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318693 | 1999-08-29 | Paper |
| Reliable communication over partially authenticated networks | 1999-06-21 | Paper |
| Learning boxes in high dimension | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343447 | 1997-12-01 | Paper |
| Lower bounds for monotone span programs | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341771 | 1997-07-20 | Paper |
| Communication in key distribution schemes | 1996-06-02 | Paper |
| Universally ideal secret-sharing schemes | 1995-07-12 | Paper |
