László Csirmaz

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j8		László Csirmaz, Gábor Tardos: Optimal Information Rate of Secret Sharing Schemes on Trees. IEEE Transactions on Information Theory 59(4): 2527-2530 (2013)
i12		László Csirmaz, Gábor Tardos: Optimal information rate of secret sharing schemes on trees. CoRR abs/1302.4609 (2013)
	2012
j7		László Csirmaz, Gábor Tardos: On-line secret sharing. Des. Codes Cryptography 63(1): 127-147 (2012)
j6		László Csirmaz: Complexity of universal access structures. Inf. Process. Lett. 112(4): 149-152 (2012)
i11		Alexander Dibert, László Csirmaz: Infinite Secret Sharing - Examples. IACR Cryptology ePrint Archive 2012: 411 (2012)
i10		László Csirmaz: Probabilistic Infinite Secret Sharing. IACR Cryptology ePrint Archive 2012: 412 (2012)
	2011
i9		László Csirmaz, Gábor Tardos: On-line secret sharing. IACR Cryptology ePrint Archive 2011: 174 (2011)
i8		László Csirmaz: Complexity of universal access structures. IACR Cryptology ePrint Archive 2011: 375 (2011)
i7		László Csirmaz: How to share secrets simultaneously. IACR Cryptology ePrint Archive 2011: 386 (2011)
	2009
j5		László Csirmaz, Péter Ligeti: On an infinite family of graphs with information ratio 2 - 1/k. Computing 85(1-2): 127-136 (2009)
j4		László Csirmaz: An impossibility result on graph secret sharing. Des. Codes Cryptography 53(3): 195-209 (2009)
i6		László Csirmaz: On the impossibility of graph secret sharing. IACR Cryptology ePrint Archive 2009: 59 (2009)
i5		László Csirmaz, Gábor Tardos: Secret sharing on trees: problem solved. IACR Cryptology ePrint Archive 2009: 71 (2009)
	2007
i4		László Csirmaz: Secret sharing on infinite graphs. IACR Cryptology ePrint Archive 2007: 297 (2007)
i3		László Csirmaz: Secret sharing on the infinite ladder. IACR Cryptology ePrint Archive 2007: 355 (2007)
	2005
i2		László Csirmaz: Secret sharing schemes on graphs. IACR Cryptology ePrint Archive 2005: 59 (2005)
i1		László Csirmaz: Secret sharing on the d-dimensional cube. IACR Cryptology ePrint Archive 2005: 177 (2005)
	1997
j3		László Csirmaz: The Size of a Share Must Be Large. J. Cryptology 10(4): 223-231 (1997)
	1994
c2		László Csirmaz: The Size of a Share Must Be Large. EUROCRYPT 1994: 13-22
	1986
c1		László Csirmaz, Bradd Hart: Program Correctness on Finite Fields. LICS 1986: 4-10
	1981
j2		László Csirmaz: Iterated grammars. Acta Cybern. 5: 43-47 (1981)
j1		László Csirmaz: On the completeness of proving partial correctness. Acta Cybern. 5: 181-190 (1981)

Coauthor Index

1	Alexander Dibert	[i11]
2	Bradd Hart	[c1]
3	Péter Ligeti	[j5]
4	Gábor Tardos	[j8] [i12] [j7] [i9] [i5]

Last update Sun May 26 03:53:47 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page