| The size of a share must be large L Csirmaz Journal of cryptology 10 (4), 223-231, 1997 | 250 | 1997 |
| The dealer's random bits in perfect secret sharing schemes L Csirmaz Studia Scientiarum Mathematicarum Hungarica 32 (3), 429-438, 1996 | 60 | 1996 |
| Secret sharing schemes on graphs L Csirmaz Studia Scientiarum Mathematicarum Hungarica 44 (3), 297-306, 2007 | 52 | 2007 |
| Entropy region and convolution F Matúš, L Csirmaz IEEE Transactions on Information Theory 62 (11), 6007-6018, 2016 | 43 | 2016 |
| An impossibility result on graph secret sharing L Csirmaz Designs, Codes and Cryptography 53, 195-209, 2009 | 41 | 2009 |
| Programs and program verifications in a general setting L Csirmaz Theoretical Computer Science 16 (2), 199-210, 1981 | 39 | 1981 |
| Variations on a game J Beck, L Csirmaz Journal of Combinatorial Theory, Series A 33 (3), 297-315, 1982 | 38 | 1982 |
| Optimal information rate of secret sharing schemes on trees L Csirmaz, G Tardos IEEE transactions on information theory 59 (4), 2527-2530, 2012 | 33 | 2012 |
| On an infinite family of graphs with information ratio 2 − 1/k L Csirmaz, P Ligeti Computing 85, 127-136, 2009 | 32 | 2009 |
| Secret sharing on the d-dimensional cube L Csirmaz Designs, Codes and Cryptography 74 (3), 719-729, 2015 | 29* | 2015 |
| Using multiobjective optimization to map the entropy region L Csirmaz Computational Optimization and Applications 63, 45-67, 2016 | 26 | 2016 |
| Authentication method and system A Haraszti, L Marsovszky, G Katona, T Nemetz, M Dezso, L Csirmaz, ... US Patent App. 10/553,561, 2007 | 22 | 2007 |
| On-line secret sharing L Csirmaz, G Tardos Designs, Codes and Cryptography 63, 127-147, 2012 | 21 | 2012 |
| On the completeness of proving partial correctness L Csirmaz Acta Cybernetica 5 (2), 181-190, 1981 | 18 | 1981 |
| Erdős–Pyber theorem for hypergraphs and secret sharing L Csirmaz, P Ligeti, G Tardos Graphs and Combinatorics 31, 1335-1346, 2015 | 14 | 2015 |
| Geometrical cryptography L Csirmaz, GOH Katona Proc. International Workshop on Coding and Cryptography, 14-15, 2003 | 14 | 2003 |
| A completeness theorem for dynamic logic. L Csirmaz Notre Dame journal of formal logic 26 (1), 51-60, 1985 | 14 | 1985 |
| A property of 2‐sorted peano models and program verification L Csirmaz, JB Paris Mathematical Logic Quarterly 30 (19‐24), 325-334, 1984 | 14 | 1984 |
| Exact bounds on tree based secret sharing schemes L Csirmaz, G Tardos Tatracrypt, Slovakia, 2007 | 12 | 2007 |
| A survey of semantics of Floyd-Hoare derivability L Csirmaz | 12 | 1980 |
