S. Dziembowski: Publications

journals:

Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, and Tal Malkin
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
Journal of Cryptology vol. 17, no. 3, pp. 153-207, Jun 2004
Stefan Dziembowski and Ueli Maurer
Optimal Randomizer Efficiency in the Bounded-Storage Model

Journal of Cryptology, vol. 17, no. 1, pp. 5-26, Jan 2004,
Stefan Dziembowski and Ueli Maurer
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2790-2792, Jun 2008.

conferences:

Stefan Dziembowski and Krzysztof Pietrzak
Leakage-Resilient Cryptography
49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2008
Stefan Dziembowski and Krzysztof Pietrzak
Intrusion-Resilient Secret Sharing
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2007
Stefan Dziembowski
On Forward-Secure Storage
Advances in Cryptology - CRYPTO '06, Lecture Notes in Computer Science, Springer-Verlag, August 2006
Stefan Dziembowski
Intrusion-Resilience via the Bounded-Storage Model
Theory of Cryptography Conference (TCC) 2006, Lecture Notes in Computer Science, Springer-Verlag, March 2006
Stefan Dziembowski and Ueli Maurer

On Generating the Initial Key in the Bounded-Storage Model

Advances in Cryptology - EUROCRYPT '04, Lecture Notes in Computer Science, Springer-Verlag, May 2004.
Stefan Dziembowski and Ueli Maurer
Tight Security Proofs for the Bounded-Storage Model
Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM, pp. 341-350, May 2002

Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, and Tal Malkin
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
Advances in Cryptology - EUROCRYPT '01, Lecture Notes in Computer Science, Springer-Verlag, vol. 2045, pp. 262-279, May 2001

Ronald Cramer, Ivan Damgård, and Stefan Dziembowski
On the Complexity of Verifiable Secret Sharing and Multiparty Computation
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM, pp. 325-334, May 2000.

Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Advances in Cryptology - EUROCRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 311-326, May 1999.
Stefan Dziembowski, Marcin Jurdzinski, and Igor Walukiewicz
How Much Memory is Needed to Win Infinite Games?
Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE, pp. 99-110, Jun 1997.
Stefan Dziembowski
Bounded-Variable Fixpoint Queries are PSPACE-complete
Computer Science Logic '96, LNCS, Springer, vol. 1258, pp. 89-105, Sep 1996.

theses:

Stefan Dziembowski
O zlozonosci problemu obliczania odpowiedzi na zapytania w relacyjnych bazach danych, wyrazone w logice z operatorem punktu stalego.
University of Warsaw 1996 (supervisor: Damian Niwinski)
Stefan Dziembowski
Multiparty Computations Information-Theoretically Secure Against an Adaptive Adversary
Aarhus University 2001 (supervisor: Ivan Damgard)
BRICS Dissertation Series, DS-01-1
Available files: [Postscript ] [PDF]

S. Dziembowski : Publications