Stefan Dziembowski

	2012
34		Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Circuits without Computational Assumptions. TCC 2012: 230-247
	2011
33		Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Cryptography from the Inner-Product Extractor. ASIACRYPT 2011: 702-721
32		Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: Key-Evolution Schemes Resilient to Space-Bounded Leakage. CRYPTO 2011: 335-353
31		Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: One-Time Computable Self-erasing Functions. TCC 2011: 125-143
30		Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Cryptography From the Inner-Product Extractor. IACR Cryptology ePrint Archive 2011: 519 (2011)
29		Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: Key-Evolution Schemes Resilient to Space-Bounded Leakage. IACR Cryptology ePrint Archive 2011: 530 (2011)
	2010
28		Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs: Non-Malleable Codes. ICS 2010: 434-452
27		Francesco Davì, Stefan Dziembowski, Daniele Venturi: Leakage-Resilient Storage. SCN 2010: 121-137
26		Stefan Dziembowski: How to Pair with a Human. SCN 2010: 200-218
25		Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: One-time Computable and Uncomputable Functions. IACR Cryptology ePrint Archive 2010: 541 (2010)
	2009
24		Stefan Dziembowski, Alessandro Mei, Alessandro Panconesi: On Active Attacks on Sensor Network Key Distribution Schemes. ALGOSENSORS 2009: 52-63
23		Stefan Dziembowski: A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes. ICITS 2009: 19-26
22		Francesco Davì, Stefan Dziembowski, Daniele Venturi: Leakage-Resilient Storage. IACR Cryptology ePrint Archive 2009: 399 (2009)
21		Stefan Dziembowski: How to pair with a human. IACR Cryptology ePrint Archive 2009: 562 (2009)
20		Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs: Non-Malleable Codes. IACR Cryptology ePrint Archive 2009: 608 (2009)
	2008
19		Stefan Dziembowski, Krzysztof Pietrzak: Leakage-Resilient Cryptography. FOCS 2008: 293-302
18		Stefan Dziembowski, Krzysztof Pietrzak: Leakage-Resilient Cryptography in the Standard Model. IACR Cryptology ePrint Archive 2008: 240 (2008)
17		Stefan Dziembowski, Ueli M. Maurer: The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement. IEEE Transactions on Information Theory 54(6): 2790-2792 (2008)
	2007
16		Stefan Dziembowski, Krzysztof Pietrzak: Intrusion-Resilient Secret Sharing. FOCS 2007: 227-237
15		Stefan Dziembowski, Krzysztof Pietrzak: Intrusion-Resilient Secret Sharing. IACR Cryptology ePrint Archive 2007: 359 (2007)
	2006
14		Stefan Dziembowski: On Forward-Secure Storage. CRYPTO 2006: 251-270
13		Stefan Dziembowski: Intrusion-Resilience Via the Bounded-Storage Model. TCC 2006: 207-224
	2005
12		Stefan Dziembowski: Intrusion-Resilience via the Bounded-Storage Model. IACR Cryptology ePrint Archive 2005: 179 (2005)
	2004
11		Stefan Dziembowski, Ueli M. Maurer: On Generating the Initial Key in the Bounded-Storage Model. EUROCRYPT 2004: 126-137
10		Stefan Dziembowski, Ueli M. Maurer: Optimal Randomizer Efficiency in the Bounded-Storage Model. J. Cryptology 17(1): 5-26 (2004)
9		Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: Adaptive versus Non-Adaptive Security of Multi-Party Protocols. J. Cryptology 17(3): 153-207 (2004)
	2002
8		Stefan Dziembowski, Ueli M. Maurer: Tight security proofs for the bounded-storage model. STOC 2002: 341-350
	2001
7		Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279
6		Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On adaptive vs. non-adaptive security of multiparty protocols. IACR Cryptology ePrint Archive 2001: 17 (2001)
	2000
5		Ronald Cramer, Ivan Damgård, Stefan Dziembowski: On the complexity of verifiable secret sharing and multiparty computation. STOC 2000: 325-334
4		Ronald Cramer, Ivan Damgård, Stefan Dziembowski: On the Complexity of Verifiable Secret Sharing and Multi-Party Computation. IACR Cryptology ePrint Archive 2000: 38 (2000)
	1999
3		Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin: Efficient Multiparty Computations Secure Against an Adaptive Adversary. EUROCRYPT 1999: 311-326
	1997
2		Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz: How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110
	1996
1		Stefan Dziembowski: Bounded-Variable Fixpoint Queries are PSPACE-complete. CSL 1996: 89-105

Coauthor Index

1	Ran Canetti	[6] [7] [9]
2	Ronald Cramer	[3] [4] [5]
3	Ivan Damgård (Ivan Bjerre Damgård)	[3] [4] [5] [6] [7] [9]
4	Francesco Davì	[22] [27]
5	Sebastian Faust	[30] [33] [34]
6	Martin Hirt	[3]
7	Yuval Ishai	[6] [7] [9]
8	Marcin Jurdzinski	[2]
9	Tomasz Kazana	[25] [29] [31] [32]
10	Tal Malkin	[6] [7] [9]
11	Ueli Maurer (Ueli M. Maurer)	[8] [10] [11] [17]
12	Alessandro Mei	[24]
13	Alessandro Panconesi	[24]
14	Krzysztof Pietrzak	[15] [16] [18] [19] [20] [28]
15	Tal Rabin	[3]
16	Daniele Venturi	[22] [27]
17	Igor Walukiewicz	[2]
18	Daniel Wichs	[20] [25] [28] [29] [31] [32]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page