Stefan Dziembowski

Shahriar Ebrahimi

Parisa Hassanizadeh

IACR Cryptol. ePrint Arch., 2024

From Random Probing to Noisy Leakages Without Field-Size Dependence.

[BibT_eX]

[DOI]

Gianluca Brian

IACR Cryptol. ePrint Arch., 2024

2023

Individual Cryptography.

[BibT_eX]

[DOI]

Tomasz Lizurej

IACR Cryptol. ePrint Arch., 2023

Efficiently Testable Circuits without Conductivity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Non-Atomic Payment Splitting in Channel Networks.

[BibT_eX]

[DOI]

Pawel Kedzior

Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

On Manipulating Weight Predictions in Signed Weighted Networks.

[BibT_eX]

[DOI]

Tomasz Lizurej

Tomasz Michalak

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Efficiently Testable Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Trojan-Resilience without Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

Ethna: Channel Network with Dynamic Internal Payment Splitting.

[BibT_eX]

[DOI]

Pawel Kedzior

IACR Cryptol. ePrint Arch., 2020

Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

Unifying Leakage Models: From Probing Attacks to Noisy Leakage.

[BibT_eX]

[DOI]

Alexandre Duc

J. Cryptol., 2019

Multi-Party Virtual State Channels.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Reverse Firewalls for Actively Secure MPCs.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Jesper Buus Nielsen

IACR Cryptol. ePrint Arch., 2019

Perun: Virtual Payment Hubs over Cryptocurrencies.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Simple Refreshing in the Noisy Leakage Model.

[BibT_eX]

[DOI]

Karol Zebrowski

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Non-Malleable Codes.

[BibT_eX]

[DOI]

J. ACM, 2018

Quasi chain rule for min-entropy.

[BibT_eX]

[DOI]

Maciej Zdanowicz

Inf. Process. Lett., 2018

Foundations of State Channel Networks.

[BibT_eX]

[DOI]

Kristina Hostáková

IACR Cryptol. ePrint Arch., 2018

FairSwap: How to fairly exchange digital goods.

[BibT_eX]

[DOI]

Lisa Eckey

IACR Cryptol. ePrint Arch., 2018

General State Channel Networks.

[BibT_eX]

[DOI]

Kristina Hostáková

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

PERUN: Virtual Payment Channels over Cryptographic Currencies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Private Circuits III: Hardware Trojan-Resilience via Testing Amplification.

[BibT_eX]

[DOI]

François-Xavier Standaert

IACR Cryptol. ePrint Arch., 2016

Towards Sound Fresh Re-Keying with Hard (Physical) Learning Problems.

[BibT_eX]

[DOI]

François-Xavier Standaert

IACR Cryptol. ePrint Arch., 2016

Position-Based Cryptography and Multiparty Communication Complexity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts.

[BibT_eX]

[DOI]

Waclaw Banasik

Daniel Malinowski

IACR Cryptol. ePrint Arch., 2016

Circuit Compilers with O(1/ log(n)) Leakage Rate.

[BibT_eX]

[DOI]

Marcin Andrychowicz

IACR Cryptol. ePrint Arch., 2016

Secure multiparty computations on Bitcoin.

[BibT_eX]

[DOI]

Commun. ACM, 2016

Optimal Amplification of Noisy Leakages.

[BibT_eX]

[DOI]

Maciej Skórski

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Bounded-Retrieval Model with Keys Derived from Private Data.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

2015

One Time Programs with Limited Memory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

On the Malleability of Bitcoin Transactions.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2015

Noisy Leakage Revisited.

[BibT_eX]

[DOI]

Maciej Skorski

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Efficient Leakage Resilient Circuit Compilers.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Proceedings of the Topics in Cryptology, 2015

PoW-Based Distributed Cryptography with No Trusted Setup.

[BibT_eX]

[DOI]

Marcin Andrychowicz

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Introduction to Cryptocurrencies.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Distributed Cryptography Based on the Proofs of Work.

[BibT_eX]

[DOI]

Marcin Andrychowicz

IACR Cryptol. ePrint Arch., 2014

Leakage-resilient non-malleable codes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Modeling Bitcoin Contracts by Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Position-Based Cryptography from Noisy Channels.

[BibT_eX]

[DOI]

Maciej Zdanowicz

Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013

Non-Malleable Codes from Two-Source Extractors.

[BibT_eX]

[DOI]

Maciej Obremski

IACR Cryptol. ePrint Arch., 2013

Proofs of Space.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Fair Two-Party Computations via the BitCoin Deposits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

How to deal with malleability of BitCoin transactions.

[BibT_eX]

[DOI]

CoRR, 2013

Leakage Resilience of the Blom's Key Distribution Scheme.

[BibT_eX]

[DOI]

Michal Jastrzebski

Proceedings of the Information Theoretic Security - 7th International Conference, 2013

2012

Leakage-Resilient Circuits without Computational Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

2011

Key-Evolution Schemes Resilient to Space-Bounded Leakage.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Leakage-Resilient Cryptography From the Inner-Product Extractor.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

One-Time Computable Self-erasing Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010

One-time Computable and Uncomputable Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

2009

How to pair with a human.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Leakage-Resilient Storage.

[BibT_eX]

[DOI]

Francesco Davì

Daniele Venturi

IACR Cryptol. ePrint Arch., 2009

A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

On Active Attacks on Sensor Network Key Distribution Schemes.

[BibT_eX]

[DOI]

Alessandro Mei

Alessandro Panconesi

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Leakage-Resilient Cryptography in the Standard Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Leakage-Resilient Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Intrusion-Resilient Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

2006

On Forward-Secure Storage.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

Intrusion-Resilience via the Bounded-Storage Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

2004

Optimal Randomizer Efficiency in the Bounded-Storage Model.

[BibT_eX]

[DOI]

J. Cryptol., 2004

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2004

On Generating the Initial Key in the Bounded-Storage Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2002

Tight security proofs for the bounded-storage model.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

On adaptive vs. non-adaptive security of multiparty protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

2000

On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.

[BibT_eX]

[DOI]

Ronald Cramer

Ivan Damgård

IACR Cryptol. ePrint Arch., 2000

On the complexity of verifiable secret sharing and multiparty computation.

[BibT_eX]

[DOI]

Ronald Cramer

Ivan Damgård

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Efficient Multiparty Computations Secure Against an Adaptive Adversary.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1997

How Much Memory is Needed to Win Infinite Games?

[BibT_eX]

[DOI]

Marcin Jurdzinski

Igor Walukiewicz

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.

[BibT_eX]

[DOI]