Vassilis Zikas

Ueli Maurer

Daniel Tschudi

J. Cryptol., June, 2024

General Adversary Structures in Byzantine Agreement and Multi-Party Computation with Active and Omission Corruption.

[BibT_eX]

[DOI]

Konstantinos Brazitikos

IACR Cryptol. ePrint Arch., 2024

2023

Etherless Ethereum tokens: Simulating native tokens in Ethereum.

[BibT_eX]

[DOI]

John Andrews

Michele Ciampi

J. Comput. Syst. Sci., August, 2023

Compilation and Backend-Independent Vectorization for Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Blockchain Governance via Sharp Anonymous Multisignatures.

[BibT_eX]

[DOI]

Wonseok Choi

Xiangyu Liu

IACR Cryptol. ePrint Arch., 2023

Fine-Tuning Ideal Worlds for the Xor of Two Permutation Outputs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary.

[BibT_eX]

[DOI]

Elad Michael Schiller

François Taïani

CoRR, 2023

Privacy-Utility Tradeoff of OLS with Random Projections.

[BibT_eX]

[DOI]

CoRR, 2023

Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory.

[BibT_eX]

[DOI]

Eli Gafni

Vasileios Zikas

CoRR, 2023

Completeness Theorems for Adaptively Secure Broadcast.

[BibT_eX]

[DOI]

Ran Cohen

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

COMBINE: COMpilation and Backend-INdependent vEctorization for Multi-Party Computation.

[BibT_eX]

[DOI]

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

2022

Eureka: A General Framework for Black-box Differential Privacy Estimators.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2021

How Private Are Commonly-Used Voting Rules?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Adaptively Secure Broadcast in Resource-Restricted Cryptography.

[BibT_eX]

[DOI]

Ran Cohen

IACR Cryptol. ePrint Arch., 2021

FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Universally Composable Almost-Everywhere Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

A Rational Protocol Treatment of 51% Attacks.

[BibT_eX]

[DOI]

Yun Lu

IACR Cryptol. ePrint Arch., 2021

Dynamic Ad Hoc Clock Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback.

[BibT_eX]

[DOI]

Leonard Kleinrock

IACR Cryptol. ePrint Arch., 2020

Round-Optimal and Communication-Efficient Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Collusion-Preserving Computation without a Mediator.

[BibT_eX]

[DOI]

Michele Ciampi

Yun Lu

IACR Cryptol. ePrint Arch., 2020

On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger.

[BibT_eX]

[DOI]

Julia Hesse

IACR Cryptol. ePrint Arch., 2020

Consensus Redux: Distributed Ledgers in the Face of Adversarial Supremacy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Universal Composition with Global Subroutines: Capturing Global Setup within plain UC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Proof-of-Reputation Blockchain with Nakamoto Fallback.

[BibT_eX]

[DOI]

Leonard Kleinrock

Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019

Probabilistic Termination and Composability of Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2019

Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing.

[BibT_eX]

[DOI]

Muhammad Ishaq

Ana L. Milanova

IACR Cryptol. ePrint Arch., 2019

Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Broadcast-Optimal Two-Round MPC.

[BibT_eX]

[DOI]

Ran Cohen

IACR Cryptol. ePrint Arch., 2019

Ouroboros Chronos: Permissionless Clock Synchronization via Proof-of-Stake.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Cryptography with Disposable Backdoors.

[BibT_eX]

[DOI]

Cryptogr., 2019

PD-ML-Lite: Private Distributed Machine Learning from Lighweight Cryptography.

[BibT_eX]

[DOI]

CoRR, 2019

PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Information Security - 22nd International Conference, 2019

2018

Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Secure Two-Party Computation over Unreliable Channels.

[BibT_eX]

[DOI]

Ran Gelles

Anat Paskin-Cherniavsky

IACR Cryptol. ePrint Arch., 2018

Cryptography with Dispensable Backdoors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

But Why does it Work? A Rational Protocol Design Treatment of Bitcoin.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

How Private Is Your Voting? A Framework for Comparing the Privacy of Voting Mechanisms.

[BibT_eX]

[DOI]

CoRR, 2018

Cryptographically Secure Detection of Injection Attacks.

[BibT_eX]

[DOI]

Yun Lu

Konstantinos Mitropoulos

Avraham Weinstock

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

2017

The Price of Low Communication in Secure Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Network-Hiding Communication and Applications to Multi-Party Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Provably Secure Virus Detection: Using The Observer Effect Against Malware.

[BibT_eX]

[DOI]

Richard J. Lipton

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware.

[BibT_eX]

[DOI]

Richard J. Lipton

IACR Cryptol. ePrint Arch., 2015

Fair and Robust Multi-Party Computation using a Global Transaction Ledger.

[BibT_eX]

[DOI]

Aggelos Kiayias

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2015

Secure Multi-Party Computation with Identifiable Abort.

[BibT_eX]

[DOI]

Yuval Ishai

IACR Cryptol. ePrint Arch., 2015

Fair Distributed Computation of Reactive Functions.

[BibT_eX]

[DOI]

Björn Tackmann

IACR Cryptol. ePrint Arch., 2015

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults.

[BibT_eX]

[DOI]

Nishanth Chandran

Wutichai Chongchitmate

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Efficient Three-Party Computation from Cut-and-Choose.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality.

[BibT_eX]

[DOI]

Nishanth Chandran

Wutichai Chongchitmate

IACR Cryptol. ePrint Arch., 2014

Distributing the setup in universally composable multi-party computation.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013

Information-Theoretic Secure Multiparty Computation.

[BibT_eX]

[DOI]

Ueli Maurer

Proceedings of the Secure Multi-Party Computation, 2013

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

2012

Byzantine Agreement with a Rational Adversary.

[BibT_eX]

[DOI]

Adam Groce

Jonathan Katz

Aishwarya Thiruvengadam

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Universally Composable Synchronous Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Collusion-Preserving Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Player-Centric Byzantine Agreement.

[BibT_eX]

[DOI]

Martin Hirt

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Generalized corruption models in secure multi-party computation.

[BibT_eX]

[DOI]

PhD thesis, 2010

2009

Adaptively Secure Broadcast.

[BibT_eX]

[DOI]

Martin Hirt

IACR Cryptol. ePrint Arch., 2009

Realistic Failures in Secure Multi-party Computation.

[BibT_eX]

[DOI]

Sarah Hauser

Ueli M. Maurer

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008

MPC vs. SFE : Unconditional and Computational Security.

[BibT_eX]

[DOI]

Martin Hirt

Ueli M. Maurer