Stefan Dziembowski

According to our database1, Stefan Dziembowski authored at least 59 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
J. Cryptology, 2019

Multi-Party Virtual State Channels.
IACR Cryptology ePrint Archive, 2019

Reverse Firewalls for Actively Secure MPCs.
IACR Cryptology ePrint Archive, 2019

Perun: Virtual Payment Hubs over Cryptocurrencies.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Simple Refreshing in the Noisy Leakage Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Non-Malleable Codes.
J. ACM, 2018

Quasi chain rule for min-entropy.
Inf. Process. Lett., 2018

Foundations of State Channel Networks.
IACR Cryptology ePrint Archive, 2018

FairSwap: How to fairly exchange digital goods.
IACR Cryptology ePrint Archive, 2018

General State Channel Networks.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
PERUN: Virtual Payment Channels over Cryptographic Currencies.
IACR Cryptology ePrint Archive, 2017

2016
Private Circuits III: Hardware Trojan-Resilience via Testing Amplification.
IACR Cryptology ePrint Archive, 2016

Towards Sound Fresh Re-Keying with Hard (Physical) Learning Problems.
IACR Cryptology ePrint Archive, 2016

Position-Based Cryptography and Multiparty Communication Complexity.
IACR Cryptology ePrint Archive, 2016

Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts.
IACR Cryptology ePrint Archive, 2016

Circuit Compilers with O(1/ log(n)) Leakage Rate.
IACR Cryptology ePrint Archive, 2016

Secure multiparty computations on Bitcoin.
Commun. ACM, 2016

Optimal Amplification of Noisy Leakages.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Bounded-Retrieval Model with Keys Derived from Private Data.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

2015
One Time Programs with Limited Memory.
IACR Cryptology ePrint Archive, 2015

On the Malleability of Bitcoin Transactions.
Proceedings of the Financial Cryptography and Data Security, 2015

Noisy Leakage Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Efficient Leakage Resilient Circuit Compilers.
Proceedings of the Topics in Cryptology, 2015

PoW-Based Distributed Cryptography with No Trusted Setup.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Introduction to Cryptocurrencies.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Distributed Cryptography Based on the Proofs of Work.
IACR Cryptology ePrint Archive, 2014

Leakage-resilient non-malleable codes.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Modeling Bitcoin Contracts by Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Position-Based Cryptography from Noisy Channels.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013
Non-Malleable Codes from Two-Source Extractors.
IACR Cryptology ePrint Archive, 2013

Proofs of Space.
IACR Cryptology ePrint Archive, 2013

Fair Two-Party Computations via the BitCoin Deposits.
IACR Cryptology ePrint Archive, 2013

How to deal with malleability of BitCoin transactions.
CoRR, 2013

Leakage Resilience of the Blom's Key Distribution Scheme.
Proceedings of the Information Theoretic Security - 7th International Conference, 2013

2012
Leakage-Resilient Circuits without Computational Assumptions.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

2011
Key-Evolution Schemes Resilient to Space-Bounded Leakage.
IACR Cryptology ePrint Archive, 2011

Leakage-Resilient Cryptography From the Inner-Product Extractor.
IACR Cryptology ePrint Archive, 2011

One-Time Computable Self-erasing Functions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
One-time Computable and Uncomputable Functions.
IACR Cryptology ePrint Archive, 2010

2009
How to pair with a human.
IACR Cryptology ePrint Archive, 2009

Leakage-Resilient Storage.
IACR Cryptology ePrint Archive, 2009

A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

On Active Attacks on Sensor Network Key Distribution Schemes.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement.
IEEE Trans. Information Theory, 2008

Leakage-Resilient Cryptography in the Standard Model.
IACR Cryptology ePrint Archive, 2008

Leakage-Resilient Cryptography.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Intrusion-Resilient Secret Sharing.
IACR Cryptology ePrint Archive, 2007

2006
On Forward-Secure Storage.
Proceedings of the Advances in Cryptology, 2006

2005
Intrusion-Resilience via the Bounded-Storage Model.
IACR Cryptology ePrint Archive, 2005

2004
Optimal Randomizer Efficiency in the Bounded-Storage Model.
J. Cryptology, 2004

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
J. Cryptology, 2004

On Generating the Initial Key in the Bounded-Storage Model.
Proceedings of the Advances in Cryptology, 2004

2002
Tight security proofs for the bounded-storage model.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
On adaptive vs. non-adaptive security of multiparty protocols.
IACR Cryptology ePrint Archive, 2001

2000
On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.
IACR Cryptology ePrint Archive, 2000

On the complexity of verifiable secret sharing and multiparty computation.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Efficient Multiparty Computations Secure Against an Adaptive Adversary.
Proceedings of the Advances in Cryptology, 1999

1997
How Much Memory is Needed to Win Infinite Games?
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996
Bounded-Variable Fixpoint Queries are PSPACE-complete.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996


  Loading...