| Publication | Date of Publication | Type |
|---|
| Bipartite secret sharing and staircases | 2024-03-27 | Paper |
| Common information, matroid representation, and secret sharing for matroid ports | 2021-01-25 | Paper |
| Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing | 2020-12-04 | Paper |
| Improving the linear programming technique in the search for lower bounds in secret sharing | 2018-07-09 | Paper |
| On the information ratio of non-perfect secret sharing schemes | 2018-01-05 | Paper |
| Ideal Hierarchical Secret Sharing Schemes | 2017-07-12 | Paper |
| Natural Generalizations of Threshold Secret Sharing | 2017-05-16 | Paper |
| Secret Sharing, Rank Inequalities, and Information Inequalities | 2017-04-28 | Paper |
| Robust vector space secret sharing schemes | 2016-06-09 | Paper |
| Spanners of de Bruijn and Kautz graphs | 2016-05-26 | Paper |
| Spanners of underlying graphs of iterated line digraphs | 2016-05-26 | Paper |
| On Secret Sharing with Nonlinear Product Reconstruction | 2015-07-21 | Paper |
| Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model | 2015-07-06 | Paper |
| Extending Brickell-Davenport theorem to non-perfect secret sharing schemes | 2015-02-19 | Paper |
| Optimal Non-perfect Uniform Secret Sharing Schemes | 2014-08-07 | Paper |
| Algebraic manipulation detection codes | 2014-03-05 | Paper |
| Multi-linear Secret-Sharing Schemes | 2014-02-18 | Paper |
| On the representability of the biuniform matroid | 2014-01-21 | Paper |
| Secret Sharing, Rank Inequalities and Information Inequalities | 2013-09-17 | Paper |
| Finding lower bounds on the complexity of secret sharing schemes by linear programming | 2013-04-25 | Paper |
| Linear threshold multisecret sharing schemes | 2012-10-23 | Paper |
| Ideal multipartite secret sharing schemes | 2012-07-10 | Paper |
| On the optimization of bipartite secret sharing schemes | 2012-03-23 | Paper |
| Natural generalizations of threshold secret sharing | 2011-12-02 | Paper |
| Optimal complexity of secret sharing schemes with four minimal qualified subsets | 2011-09-27 | Paper |
| Ideal secret sharing schemes for useful multipartite access structures | 2011-06-08 | Paper |
| On secret sharing schemes, matroids and polymatroids | 2010-11-12 | Paper |
| Linear threshold multisecret sharing schemes | 2010-09-29 | Paper |
| On the Optimization of Bipartite Secret Sharing Schemes | 2010-09-29 | Paper |
| Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming | 2010-04-27 | Paper |
| Ideal hierarchical secret sharing schemes | 2010-02-24 | Paper |
| Distributed RSA Signature Schemes for General Access Structures | 2010-02-09 | Paper |
| Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes | 2010-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625878 | 2009-05-22 | Paper |
| On the diameter of matroid ports | 2009-04-07 | Paper |
| Ideal secret sharing schemes whose minimal qualified subsets have at most three participants | 2009-03-31 | Paper |
| A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra | 2009-03-10 | Paper |
| On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes | 2009-02-24 | Paper |
| Correction to “Secret Sharing Schemes With Bipartite Access Structure” | 2008-12-21 | Paper |
| Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants | 2008-11-27 | Paper |
| Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors | 2008-04-15 | Paper |
| On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes | 2008-03-17 | Paper |
| Matroids Can Be Far from Ideal Secret Sharing | 2008-03-05 | Paper |
| Ideal Multipartite Secret Sharing Schemes | 2007-11-29 | Paper |
| Representing Small Identically Self‐Dual Matroids by Self‐Dual Codes | 2007-11-16 | Paper |
| On Secret Sharing Schemes, Matroids and Polymatroids | 2007-08-30 | Paper |
| Secret sharing schemes on access structures with intersection number equal to one | 2006-04-28 | Paper |
| Secret sharing schemes on sparse homogeneous access structures with rank three | 2005-04-25 | Paper |
| Secret sharing schemes with three or four minimal qualified subsets | 2005-02-28 | Paper |
| A linear algebraic approach to metering schemes | 2005-01-17 | Paper |
| Improving the trade-off between storage and communication in broadcast encryption schemes | 2004-11-23 | Paper |
| Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448383 | 2004-02-18 | Paper |
| Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs" | 2003-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414294 | 2003-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408455 | 2003-06-29 | Paper |
| A ramp model for distributed key distribution schemes | 2003-06-10 | Paper |
| Linear broadcast encryption schemes | 2003-06-10 | Paper |
| Linear key predistribution schemes | 2003-03-19 | Paper |
| Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. | 2003-01-21 | Paper |
| Taking cube roots in \(\mathbb Z_{m}\) | 2002-09-03 | Paper |
| Weighted threshold secret sharing schemes | 2002-07-25 | Paper |
| Partial line directed hypergraphs | 2002-07-01 | Paper |
| Secret sharing schemes with detection of cheaters for a general access structure | 2002-05-28 | Paper |
| Connectivity and fault-tolerance of hyperdigraphs | 2002-05-15 | Paper |
| New bounds on the diameter vulnerability of iterated line digraphs | 2002-03-29 | Paper |
| A ramp model for distributed key distribution schemes | 2001-10-14 | Paper |
| Linear broadcast encryption schemes | 2001-10-14 | Paper |
| Secret sharing schemes with bipartite access structure | 2001-03-19 | Paper |
| Disjoint paths of bounded length in large generalized cycles | 2000-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934327 | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249661 | 1999-06-17 | Paper |
| Detection of cheaters in vector space secret sharing schemes | 1999-04-13 | Paper |
| Fault-Tolerant Fixed Routings in Some Families of Digraphs | 1998-09-21 | Paper |
| Diameter-vulnerability of large bipartite digraphs | 1996-11-21 | Paper |
| Diameter vulnerability of iterated line digraphs | 1996-03-25 | Paper |
| A Note on Extension Properties and Representations of Matroids | N/A | Paper |
| Efficient Representation of Lattice Path Matroids | N/A | Paper |
