Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Oriol Farràs, Tarik Kaced, Sebastià Martı́n, Carles Padró

Published Jan 1, 2018• 18 citations
Publisher
DOI
10.1007/978-3-319-78381-9_22

Related papers

Finding lower bounds on the complexity of secret sharing schemes by linear programming

Carles Padró, Leonor Vázquez, Yang An

Discrete Applied Mathematics•Nov 9, 2012•24 citations

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

Carles Padró, Leonor Vázquez

Lecture notes in computer science•Jan 1, 2010•14 citations

Lower bounds for robust secret sharing schemes

Carlo Blundo, Alfredo De Santis

Information Processing Letters•Sep 1, 1997•22 citations

Stronger Lower Bounds for Leakage-Resilient Secret Sharing

Charlotte Hoffmann, Mark Simkin

Lecture notes in computer science•Jan 1, 2023•3 citations

Lower Bounds for Leakage-Resilient Secret Sharing

Jesper Buus Nielsen, Mark Simkin

Lecture notes in computer science•Jan 1, 2020•27 citations

A Lower Bound on the Share Size of Leakage-Resilient Secret-Sharing Schemes

Sabyasachi Dutta, Shaoquan Jiang, Reihaneh Safavi–Naini

Fields Institute communications•Nov 16, 2023•0 citations