1.6k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Central European UniversityAT34 papers
- HUN-REN Alfréd Rényi Institute of MathematicsHU24 papers
- Hungarian Academy of SciencesHU23 papers
- Aalto UniversityFI16 papers
- Budapest University of Technology and EconomicsHU14 papers
- Northeastern UniversityUS9 papers
- Harvard UniversityUS7 papers
- Institute for Scientific InterchangeIT7 papers
- Brigham and Women's HospitalUS6 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- Complexity Science HubAT6 papers
- The Alan Turing InstituteGB6 papers
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2019★ 1 cited
Complexity of universal access structures
Laszlo Csirmaz
An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, name…
cs.CR2013
Gruppen secret sharing, or, how to share several secrets if you must?
Laszlo Csirmaz
Each member of an -person team has a secret, say a password. The out of gruppen secret sharing requires that any group of members should be able to recover the secre…
cs.CR2013★ 10 cited
Secret sharing on the -dimensional cube
Laszlo Csirmaz
We prove that for the best information ratio of the perfect secret sharing scheme based on the edge set of the -dimensional cube is exactly . Using the technique deve…