- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c20 |      | Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Circuits without Computational Assumptions. TCC 2012: 230-247 |
| 2011 | ||
| c19 | | Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Cryptography from the Inner-Product Extractor. ASIACRYPT 2011: 702-721 |
| c18 | | Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: Key-Evolution Schemes Resilient to Space-Bounded Leakage. CRYPTO 2011: 335-353 |
| c17 | | Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: One-Time Computable Self-erasing Functions. TCC 2011: 125-143 |
| i11 | | Stefan Dziembowski, Sebastian Faust: Leakage-Resilient Cryptography From the Inner-Product Extractor. IACR Cryptology ePrint Archive 2011: 519 (2011) |
| i10 | | Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: Key-Evolution Schemes Resilient to Space-Bounded Leakage. IACR Cryptology ePrint Archive 2011: 530 (2011) |
| 2010 | ||
| c16 | | |
| c15 | | |
| c14 | | |
| i9 | | Stefan Dziembowski, Tomasz Kazana, Daniel Wichs: One-time Computable and Uncomputable Functions. IACR Cryptology ePrint Archive 2010: 541 (2010) |
| 2009 | ||
| c13 | | Stefan Dziembowski, Alessandro Mei, Alessandro Panconesi: On Active Attacks on Sensor Network Key Distribution Schemes. ALGOSENSORS 2009: 52-63 |
| c12 | | Stefan Dziembowski: A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes. ICITS 2009: 19-26 |
| i8 | | Francesco Davì, Stefan Dziembowski, Daniele Venturi: Leakage-Resilient Storage. IACR Cryptology ePrint Archive 2009: 399 (2009) |
| i7 | | |
| i6 | | Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs: Non-Malleable Codes. IACR Cryptology ePrint Archive 2009: 608 (2009) |
| 2008 | ||
| j3 | | 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) |
| c11 | | |
| i5 | | Stefan Dziembowski, Krzysztof Pietrzak: Leakage-Resilient Cryptography in the Standard Model. IACR Cryptology ePrint Archive 2008: 240 (2008) |
| 2007 | ||
| c10 | | |
| i4 | | Stefan Dziembowski, Krzysztof Pietrzak: Intrusion-Resilient Secret Sharing. IACR Cryptology ePrint Archive 2007: 359 (2007) |
| 2006 | ||
| c9 | | |
| c8 | | |
| 2005 | ||
| i3 | | Stefan Dziembowski: Intrusion-Resilience via the Bounded-Storage Model. IACR Cryptology ePrint Archive 2005: 179 (2005) |
| 2004 | ||
| j2 | | Stefan Dziembowski, Ueli M. Maurer: Optimal Randomizer Efficiency in the Bounded-Storage Model. J. Cryptology 17(1): 5-26 (2004) |
| j1 | | 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) |
| c7 | | Stefan Dziembowski, Ueli M. Maurer: On Generating the Initial Key in the Bounded-Storage Model. EUROCRYPT 2004: 126-137 |
| 2002 | ||
| c6 | | Stefan Dziembowski, Ueli M. Maurer: Tight security proofs for the bounded-storage model. STOC 2002: 341-350 |
| 2001 | ||
| c5 | | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279 |
| i2 | | 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 | ||
| c4 | | Ronald Cramer, Ivan Damgård, Stefan Dziembowski: On the complexity of verifiable secret sharing and multiparty computation. STOC 2000: 325-334 |
| i1 | | 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 | ||
| c3 | | Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin: Efficient Multiparty Computations Secure Against an Adaptive Adversary. EUROCRYPT 1999: 311-326 |
| 1997 | ||
| c2 | | Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz: How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110 |
| 1996 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sat May 25 16:24:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page