Carles Padró

IACR Cryptol. ePrint Arch., 2016

2015

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model.

[BibT_eX]

[DOI]

Ronald Cramer

Chaoping Xing

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

2014

Optimal Algebraic Manipulation Detection Codes.

[BibT_eX]

[DOI]

Ronald Cramer

Chaoping Xing

IACR Cryptol. ePrint Arch., 2014

Multi-linear Secret-Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Optimal Non-perfect Uniform Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

On the Representability of the Biuniform Matroid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On secret sharing with nonlinear product reconstruction.

[BibT_eX]

[DOI]

Ignacio Cascudo Pueyo

IACR Cryptol. ePrint Arch., 2013

Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Secret Sharing, Rank Inequalities and Information Inequalities.

[BibT_eX]

[DOI]

An Yang

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming.

[BibT_eX]

[DOI]

An Yang

IACR Cryptol. ePrint Arch., 2012

Lecture Notes in Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

2011

Optimal complexity of secret sharing schemes with four minimal qualified subsets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

Natural Generalizations of Threshold Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Ideal Hierarchical Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2009

On the Optimization of Bipartite Secret Sharing Schemes.

[BibT_eX]

[DOI]

Jessica Ruth Metcalf-Burton

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Linear Threshold Multisecret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the Diameter of Matroid Ports.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Matroids Can Be Far from Ideal Secret Sharing.

[BibT_eX]

[DOI]

Amos Beimel

Noam Livne

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

On Secret Sharing Schemes, Matroids and Polymatroids.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Ideal Multipartite Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.

[BibT_eX]

[DOI]

Ronald Cramer

Eike Kiltz

Proceedings of the Advances in Cryptology, 2007

2006

Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

2005

Representing small identically self-dual matroids by self-dual codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Correction to "Secret Sharing Schemes With Bipartite Access Structure".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2003

Distributed RSA Signature Schemes for General Access Structures.

[BibT_eX]

[DOI]

Javier Herranz

Proceedings of the Information Security, 6th International Conference, 2003

2002

Partial line directed hypergraphs.

[BibT_eX]

[DOI]

Networks, 2002

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Secret sharing schemes with three or four minimal qualified subsets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Linear Key Predistribution Schemes.

[BibT_eX]

Paz Morillo

Des. Codes Cryptogr., 2002

Connectivity and fault-tolerance of hyperdigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Taking cube roots in <sup>Zm</sup>.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2002

Secret Sharing Schemes on Access Structures with Intersection Number Equal to One.

[BibT_eX]

[DOI]

Proceedings of the Security in Communication Networks, Third International Conference, 2002

A Distributed and Computationally Secure Key Distribution Scheme.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 5th International Conference, 2002

2001

Improving the trade-off between storage and communication in broadcast encryption schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

A Linear Algebraic Approach to Metering Schemes.

[BibT_eX]

[DOI]

Carlo Blundo

Barbara Masucci

IACR Cryptol. ePrint Arch., 2001

Linear broadcast encryption schemes.

[BibT_eX]

[DOI]

Paz Morillo

Electron. Notes Discret. Math., 2001

A Ramp Model for Distributed Key Distribution Schemes.

[BibT_eX]

[DOI]

Carlo Blundo

Paolo D'Arco

Electron. Notes Discret. Math., 2001

New bounds on the diameter vulnerability of iterated line digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 4th International Conference, 2001

1999

Weighted Threshold Secret Sharing Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Disjoint paths of bounded length in large generalized cycles.

[BibT_eX]

[DOI]

Discret. Math., 1999

Detection of Cheaters in Vector Space Secret Sharing Schemes.

[BibT_eX]

[DOI]

Jorge Luis Villar

Des. Codes Cryptogr., 1999

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.

[BibT_eX]

[DOI]

Sergio Cabello

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Fault-Tolerant Fixed Routings in Some Families of Digraphs.

[BibT_eX]

[DOI]

Paz Morillo

Xavier Muñoz

SIAM J. Discret. Math., 1998

Robust Vector Space Secret Sharing Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Large Generalized Cycles.

[BibT_eX]

[DOI]

José Gómez

Stephane Perennes

Discret. Appl. Math., 1998

Secret Sharing Schemes with Bipartite Access Structure.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997

Spanners of de Bruijn and Kautz Graphs.

[BibT_eX]

[DOI]

Rabah Harbane

Inf. Process. Lett., 1997

Fault-Tolerant Routings in Large Generalized Cycles.

[BibT_eX]

[DOI]