Stefan Dziembowski

Publications
Influence

Stefan Dziembowski, K. Pietrzak
Computer Science
49th Annual IEEE Symposium on Foundations of…
25 October 2008

We construct a stream-cipher S whose implementation is secure even if a bounded amount of arbitrary (adversarially chosen) information on the internal state ofS is leaked during computation. Expand

Secure Multiparty Computations on Bitcoin

Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, L. Mazurek
Computer Science
IEEE Symposium on Security and Privacy
23 March 2016

We show that the Bit coin system provides an attractive way to construct a version of "timed commitments", where the committer has to reveal his secret within a certain time frame, or to pay a fine. Expand

Proofs of Space

Stefan Dziembowski, S. Faust, V. Kolmogorov, K. Pietrzak
Computer Science
CRYPTO
16 August 2015

Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of… Expand

Intrusion-Resilience Via the Bounded-Storage Model

Stefan Dziembowski
Computer Science
TCC
4 March 2006

We introduce a new method of achieving intrusion-resilience in the cryptographic protocols. Expand

Non-Malleable Codes

Stefan Dziembowski, K. Pietrzak, Daniel Wichs
Computer Science, Mathematics
ICS
26 April 2018

We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword… Expand

Efficient Multiparty Computations Secure Against an Adaptive Adversary

R. Cramer, I. Damgård, Stefan Dziembowski, M. Hirt, T. Rabin
Computer Science
EUROCRYPT
2 May 1999

We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channel model, where a broadcast channel is given and a non-zero error probability is allowed. Expand

PoW-Based Distributed Cryptography with No Trusted Setup

Marcin Andrychowicz, Stefan Dziembowski
Computer Science
CRYPTO
16 August 2015

We study the question of constructing distributed cryptographic protocols in a fully peer-to-peer scenario under the assumption that the adversary has limited computing power and there is no trusted setup (like PKI, or an unpredictable beacon). Expand

Fair Two-Party Computations via Bitcoin Deposits

Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, L. Mazurek
Computer Science
Financial Cryptography Workshops
3 March 2014

We show how the Bitcoin currency system (with a small modification) can be used to obtain fairness in any two-party secure computation protocol in the following sense: if one party aborts the protocol after learning the output then the other party gets a financial compensation (in bitcoins). Expand

Leakage-Resilient Cryptography From the Inner-Product Extractor

Stefan Dziembowski, S. Faust
Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
4 December 2011

We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bounded per observation but in total can be arbitrary large. Expand

Intrusion-Resilient Secret Sharing

Stefan Dziembowski, K. Pietrzak
Computer Science
48th Annual IEEE Symposium on Foundations of…
2007

We introduce a new primitive called intrusion-resilient secret sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed interactively using low communication complexity in k, but not in k-1 rounds. Expand

Recommended Authors