Stefan Dziembowski

Orcid: 0000-0002-6914-6425

Affiliations:
  • University of Warsaw, Poland


According to our database1, Stefan Dziembowski authored at least 80 papers between 1996 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
VIMz: Private Proofs of Image Manipulation using Folding-based zkSNARKs.
Proc. Priv. Enhancing Technol., 2025

Trustless Delegation of Vector Commitment Construction in Resource-Constrained Settings.
IACR Cryptol. ePrint Arch., 2025

Computationally-Sound Symbolic Cryptography in Lean.
IACR Cryptol. ePrint Arch., 2025

Beholder Signatures.
IACR Cryptol. ePrint Arch., 2025

TrafficProof: Privacy-Preserving Reliable Traffic Information Sharing in Social Internet of Vehicles.
IACR Cryptol. ePrint Arch., 2025

Burn Your Vote: Decentralized and Publicly Verifiable Anonymous Voting at Scale.
IACR Cryptol. ePrint Arch., 2025

Universal Channel Rebalancing: Flexible Coin Shifting in Payment Channel Networks.
IACR Cryptol. ePrint Arch., 2025

Strong Secret Sharing with Snitching.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Shutter Network: Private Transactions from Threshold Cryptography.
IACR Cryptol. ePrint Arch., 2024

VIMz: Verifiable Image Manipulation using Folding-based zkSNARKs.
IACR Cryptol. ePrint Arch., 2024

From Random Probing to Noisy Leakages Without Field-Size Dependence.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Secret Sharing with Snitching.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Password-Protected Threshold Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Efficiently Testable Circuits Without Conductivity.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Efficiently Testable Circuits.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Individual Cryptography.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Non-Atomic Payment Splitting in Channel Networks.
Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

On Manipulating Weight Predictions in Signed Weighted Networks.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021
Trojan-Resilience Without Cryptography.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Ethna: Channel Network with Dynamic Internal Payment Splitting.
IACR Cryptol. ePrint Arch., 2020

Reverse Firewalls for Actively Secure MPCs.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

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

Multi-party Virtual State Channels.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

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

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

Foundations of State Channel Networks.
IACR Cryptol. ePrint Arch., 2018

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

FairSwap: How To Fairly Exchange Digital Goods.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
PERUN: Virtual Payment Channels over Cryptographic Currencies.
IACR Cryptol. ePrint Arch., 2017

Position-Based Cryptography and Multiparty Communication Complexity.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

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

Circuit Compilers with O(1/\log (n)) Leakage Rate.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts.
Proceedings of the Computer Security - ESORICS 2016, 2016

Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

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

Private Circuits III: Hardware Trojan-Resilience via Testing Amplification.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Leakage-Resilient Non-malleable Codes.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 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

Proofs of Space.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 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 Cryptol. ePrint Arch., 2014

Secure Multiparty Computations on Bitcoin.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

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

Fair Two-Party Computations via Bitcoin Deposits.
Proceedings of the Financial Cryptography and Data Security, 2014

Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

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

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

Non-malleable Codes from Two-Source Extractors.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

One-Time Programs with Limited Memory.
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013

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

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

Key-Evolution Schemes Resilient to Space-Bounded Leakage.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Leakage-Resilient Cryptography from the Inner-Product Extractor.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
One-time Computable and Uncomputable Functions.
IACR Cryptol. ePrint Arch., 2010

How to Pair with a Human.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Leakage-Resilient Storage.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Non-Malleable Codes.
Proceedings of the Innovations in Computer Science, 2010

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. Inf. Theory, 2008

Leakage-Resilient Cryptography in the Standard Model.
IACR Cryptol. ePrint Arch., 2008

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

2007
Intrusion-Resilient Secret Sharing.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006
Intrusion-Resilience Via the Bounded-Storage Model.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

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

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

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
J. Cryptol., 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.
Proceedings of the Advances in Cryptology, 2001

2000
On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.
IACR Cryptol. ePrint Arch., 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...