László Csirmaz

I do research in Set Theory, Combinatorics, and Mathematical Logic. My favourite subject, however, is Cryptography, especially secret sharing.

You can write to me at csirmaz .

This stellar icosi-dodecahedron had been in the CEU Computer Lab. I made it from green cardboard paper. It has a specially designed interior. Look at the pictures.

This model also hangs there; it was inspired by the fork component of George Hart's No picnic sculpture.

This nice body consists of 30 identical planar forms cut out of cardboard paper. The underlying design is a regular dodecahedron.

Some titles

L. Csirmaz and G. Tardos: Online secret sharing
- Abstract
- PDF (212k)
L. Csirmaz: Ramp secret sharing and secure information storage
- Abstract
- PDF (91k)
- Presentation (PDF, 242k)
L. Csirmaz: Multilevel permission
- Abstract
- PDF (150k)
L. Csirmaz and G. Tardos: Secret sharing on trees: problem solved
- Abstract
- PDF (150k)
L. Csirmaz: On the impossibility of graph secret sharing
- Abstract
- PDF (180k)
L. Csirmaz: Secret sharing on the infinite ladder
- Abstract
- PDF (120k)
L. Csirmaz: Secret sharing on infinite graphs
- Abstract
- PDF (208k)
- Corrigendum (PDF, 75k)
L. Csirmaz: A simple algorithm with no simple verification
- Abstract
- PDF (130k)
L. Csirmaz: Secret sharing in the d-dimensional cube
- Abstract
- PDF (185k)
Csirmaz László: Titokmegosztás gráfokon (Secret Sharing on Graphs), in Hungarian
- Abstract
- PDF (188k)
L. Csirmaz: Nagy pontosságú képfeldolgozás (Subpixel image processing), in Hungarian
- Abstract
- PDF, with fonts (860k)
L. Csirmaz: Laudation of Saharon Shelah for receiving the Bolyai Prise (in Hungarian)
- pdf version
L. Csirmaz: Perimeter of rounded convex planar sets
- Abstract
- PDF version (376k)
L. Csirmaz, Gyula O.H. Katona: Gometriai kódok, in Hungarian
- PDF version (170k)
L.Csirmaz and G.O.H.Katona: Geometry of compact manifolds in cryptography
E. Csirmaz, L.Csirmaz: A communication protocol
- Abstract
- postscript version (58k)
L. Csirmaz: Connected Graph Game
- Abstract
- PDF version (121k)
L. Csirmaz: Dealer's random bits in perfect secret sharing schemes
- PDF version
L. Csirmaz: Secret sharing schemes on graphs
- PDF version (115k)
L. Csirmaz: Program correctness on finite fields
- PDF version (218k)
L. Csirmaz: A triangle inequality for polymatroids (short note)
- postscript version
M.Ajtai, L. Csirmaz, Zs.Nagy: On a generalization of the game go-moku, I
Studia Mathematica 14 (1979), pp.209-226
- Scanned pdf version (8M)
L.Csirmaz, Zs.Nagy: On a generalization of the game go-moku, II
Studia Mathematica 14 (1979) pp. 461-469
- Scanned pdf version (4.7M)
J.Beck, L. Csirmaz: Variations on a game,
Journal of Combinatorial Theory, Series A (33) 1982, pp 297-315
- preprint pdf (200k)
- Scanned pdf version (7.1M)

Presentations

Exploring the entropic region, 2021
Multipartite secret sharing CECC 2020, Zagreb, Croatia
Continuous submodular optimization, 2020
Secret sharing and duality CECC 2019, Telc, Czech Republic
Geometry of the entropy region Lecture 1, Lecture 2, Lecture 3, Nexus of Information and Computation Theories 2016, Paris
Applied vector optimization: Hunt for new entropy inequalities, EURO 2015 27th European Conference on Operational Research, Glasgow, 2015
Multiobjective optimization and the entropy region Prague Stochastics, 2014, Prague, Czech Republic
Optimal solutions of oracle defined optimization problems Set optimization meets finance II - Bruneck-Brunico, Italy, 2014
Information inequalities from the book Hong Kong, 2013
Secret sharing on infinite structures, Joint Mathematical Conference CSASC 2010, Prague, Czech Republic
Ramp secret sharing and secure information storage, IntelliSec - 1st International Workshop in Intelligent Security Systems 2009, Bucharest, Romania
Secret sharing schemes: solved & unsolved problems, CECC 2008, Graz, Austria
Elektronikus tézis és disszertáció gyüjtemény a CEU-n, Dunaújváros, 2008 Networkshop'08 konferencia
Modern Cryptopgrahy - the art of the impossibile (English version), Lecture delivered at the Hungarian Science Festval, 2007 November. Joint work with Eszter Kinga Deli
Modern Kriptográfia - a lehetetlen mûvészete, 2007 August, Dunaújváros; (in Hungarian) joint work with Eszter Kinga Deli
Exact bounds on tree based secret sharing schemes, Tatracrypt 2007, Smolenice, Slovakia
Szabad hozzáférés tudományos cikkekhez, szabad szoftverrel, NIIF IPSZILON elöadás, (in Hungarian) joint work with András Holl
My publications for everyone Eger, 2007, Networkshop'07 konferencia
Secret Sharing on Infinite Graphs Nyircrypt, 2006
Mennyire biztonságosak a kriptográfiai protokollok? Miskolc, 2006 április 20 Networkshop'06 konferencia (in Hungarian)
Secret Sharing on Graphs (in Hungarian) Nyíregyháza, April 30, 2005
On-line vizsgáztató rendszer Szeged, 2005 március 31 Networkshop'05 konferencia
Kriptográfia a Középiskolában (in Hungarian)
Zero Knowedge Protocols (in English)
Az elektronikus pénztárca
Networkshop 2000, Intelligencia az intelligens kártyában
- powerpoint 4.0
- powerpoint 7.0
Networkshop 2002, Elliptikus görbéken alapuló titkosirás
- MS word dokumentum
- rtf format
- postscript
- presentation pages
- Abstract (in English)
Geometriai kriptográfia (Katona Gyulával)
Elektronikus matematikus
Protokollok (fóliák)

Lecture notes (in Hungarian)

Cryptopgrahic Protocols (prepared by students)
Paris-Harrington Theorem about the existence of an interesting mathematical statement which is independent of Peano's arithmetic.
- dvi version (48k)
- postscript version
Julia Robinson's nice characterization of recursive functions of a single variable.
- dvi version (25k)
- postscipt version
Hilbert's Tenth Problem is Unsolvable: a complete and detailed proof.
- dvi version (70k)
- postscipt version
Shelah's theorem, saying that two structures are elementarily equivalent if and only if they have isomorphic ultrapowers.
- dvi version (37k)
- postscipt version
How to construct Aronszajn trees, and how Stevo Todorcevic colored the edges of the aleph₁ complete graph so that in each big subgraph all colors occur.
- dvi version (27k)
- postscipt version
Proofs correct up to 99%, an account on trasparent proofs. (in Hungarian)
- html format
- Word 6.0 document (20k)
Leszálló Löwenheim-Skolem Tétel, rezolúciós módszer
- dvi version (27k)
- postript version (93k)
Gödel II. nem-teljességi tétele, Löb tétel
- dvi version (13k)
- postscipt version (65k)
Rice tétel
- pdf version (32k)
Kis és nagy írott gót betûk
Matematikai Logika, egyetemi jegyzet (postsript + gzip)
Kriptológia: azonosítás
Forszolás, jegyzet (postscript)
- 1. fejezet Bevezetés
- 2. fejezet Parciális rendezések
- 3. fejezet A halmazelmélet modelljei
- 4. fejezet Generikus modell
- 5. fejezet Martin axiómája
- 6. fejezet Elsõ modellek
- 7. fejezet Permutációmodellek

Free PC programs

I am also interested in programming, you can freely use the following PC programs.

An ALGOL 68 interpreter, lots of sample programs. You can learn the usage of UNION types.
- load now (96k)
- Linux version, tgz (107k)
- Linux version directory
- DOS version directory
A nice game, conceived and written by my son when he was just 13. It is still an open problem whether a polynomial algorithm exists for solving the problem in this game.
- Play the game

Web page of Aniko Csirmaz and Elod P. Csirmaz.

Back to the Institute's home page.