Jesper Buus Nielsen

João Ribeiro

Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks.

[BibT_eX]

[DOI]

Christian Matt

Søren Eller Thomsen

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy.

[BibT_eX]

[DOI]

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

Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.

[BibT_eX]

[DOI]

Matteo Campanelli

Bernardo David

Hamidreza Khoshakhlagh

Anders Konring

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.

[BibT_eX]

[DOI]

Matteo Campanelli

Bernardo David

Hamidreza Khoshakhlagh

Anders K. Kristensen

IACR Cryptol. ePrint Arch., 2021

Random-Index PIR and Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Weight-Based Nakamoto-Style Blockchains.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

TARDIS: A Foundation of Time-Lock Puzzles in UC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Continuously Non-malleable Codes in the Split-State Model.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Leveraging Weight Functions for Optimistic Responsiveness in Blockchains.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Random-index PIR with Applications to Large-Scale Secure MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

CRAFT: Composable Randomness and Almost Fairness from Time.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

TARDIS: Time And Relative Delays In Simulation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Afgjort: A Partially Synchronous Finality Layer for Blockchains.

[BibT_eX]

[DOI]

Thomas Dinsdale-Young

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Fast Threshold ECDSA with Honest Majority.

[BibT_eX]

[DOI]

Thomas Pelle Jakobsen

Michael Bæksvang Østergård

Jakob Illeborg Pagter

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Lower Bounds for Leakage-Resilient Secret Sharing.

[BibT_eX]

[DOI]

Mark Simkin

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Reverse Firewalls for Actively Secure MPCs.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Stefan Dziembowski

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Afgjort - A Semi-Synchronous Finality Layer for Blockchains.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Lower Bounds for Oblivious Data Structures.

[BibT_eX]

[DOI]

Riko Jacob

Kasper Green Larsen

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing.

[BibT_eX]

[DOI]

Kasper Green Larsen

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Yes, There is an Oblivious RAM Lower Bound!

[BibT_eX]

[DOI]

Kasper Green Larsen

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Continuously Non-malleable Codes with Split-State Refresh.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2018

2017

Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Universally Composable Zero-Knowledge Proof of Membership.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.

[BibT_eX]

[DOI]

Nico Döttling

Maciej Obremski

Electron. Colloquium Comput. Complex., 2017

On the Computational Overhead of MPC with Dishonest Majority.

[BibT_eX]

[DOI]

Samuel Ranellucci

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Fully Leakage-Resilient Codes.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Non-malleable Codes with Split-State Refresh.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Predictable Arguments of Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO.

[BibT_eX]

[DOI]

Thomas Schneider

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

DUPLO: Unifying Cut-and-Choose for Garbled Circuits.

[BibT_eX]

[DOI]

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

TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation.

[BibT_eX]

[DOI]

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

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead.

[BibT_eX]

[DOI]

Satrajit Ghosh

Tobias Nilges

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Cross&Clean: Amortized Garbled Circuits with Constant Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Cross and Clean: Amortized Garbled Circuits with Constant Overhead.

[BibT_eX]

[DOI]

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

On the Complexity of Additively Homomorphic UC Commitments.

[BibT_eX]

[DOI]

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

Unconditionally Secure Computation with Reduced Interaction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

On the Communication Required for Unconditionally Secure Multiplication.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Michael A. Raskin

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Reactive Garbling: Foundation, Instantiation, Application.

[BibT_eX]

[DOI]

Samuel Ranellucci

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Foundations of Reactive Garbling Schemes.

[BibT_eX]

[DOI]

Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2015

TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

On the Communication required for Unconditionally Secure Multiplication.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

IACR Cryptol. ePrint Arch., 2015

Unconditionally Secure Computation with Reduced Interaction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer.

[BibT_eX]

[DOI]

Sai Sheshank Burra

Enrique Larraia

IACR Cryptol. ePrint Arch., 2015

A Tamper and Leakage Resilient von Neumann Architecture.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Additively Homomorphic UC Commitments with Optimal Amortized Overhead.

[BibT_eX]

[DOI]

Ignacio Cascudo

Bernardo Machado David

Irene Giacomelli

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation.

[BibT_eX]

[DOI]

Frédéric Dupuis

Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Secure Multiparty Computation and Secret Sharing.

[BibT_eX]

[DOI]

Ronald Cramer

Cambridge University Press, ISBN: 9781107043053, 2015

2014

Invisible Adaptive Attacks.

[BibT_eX]

[DOI]

Mario Strefler

IACR Cryptol. ePrint Arch., 2014

A Tamper and Leakage Resilient Random Access Machine.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Continuous Non-malleable Codes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Faster Maliciously Secure Two-Party Computation Using the GPU.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Adaptive versus Static Security in the UC Model.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 8th International Conference, 2014

Leakage-Resilient Signatures with Graceful Degradation.

[BibT_eX]

[DOI]

Angela Zottarel

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

A Framework for Outsourcing of Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, 2014

Compact VSS and Efficient Homomorphic UC Commitments.

[BibT_eX]

[DOI]

Bernardo Machado David

Irene Giacomelli

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

On the Connection between Leakage Tolerance and Adaptive Security.

[BibT_eX]

[DOI]

Angela Zottarel

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Secure Key Management in the Cloud.

[BibT_eX]

[DOI]

Jakob Illeborg Pagter

Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Superposition Attacks on Cryptographic Protocols.

[BibT_eX]

[DOI]

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

MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions.

[BibT_eX]

[DOI]

Thomas Pelle Jakobsen

Proceedings of the Advances in Cryptology, 2013

Limits on the Power of Cryptographic Cheap Talk.

[BibT_eX]

[DOI]

Pavel Hubácek

Alon Rosen

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Fast and Maliciously Secure Two-Party Computation Using the GPU.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2013

2012

A New Approach to Practical Active-Secure Two-Party Computation.

[BibT_eX]

[DOI]

Sai Sheshank Burra

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Actively Secure Two-Party Evaluation of Any Quantum Operation.

[BibT_eX]

[DOI]

Frédéric Dupuis

Louis Salvail

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Signature Schemes Secure against Hard-to-Invert Leakage.

[BibT_eX]

[DOI]

Sebastian Faust

Carmit Hazay

Angela Zottarel

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Using Inverted Indices for Accelerating LINGO Calculations.

[BibT_eX]

[DOI]

Thomas Greve Kristensen

J. Chem. Inf. Model., 2011

A sub-cubic time algorithm for computing the quartet distance between two general trees.

[BibT_eX]

[DOI]

Anders K. Kristensen

Thomas Mailund

Algorithms Mol. Biol., 2011

Perfectly Secure Oblivious RAM without Random Oracles.

[BibT_eX]

[DOI]

Sigurd Meldgaard

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

Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space.

[BibT_eX]

[DOI]

Andreas Sand

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Lower and Upper Bounds for Deniable Public-Key Encryption.

[BibT_eX]

[DOI]

Rikke Bendlin

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Fully Simulatable Quantum-Secure Coin-Flipping and Applications.

[BibT_eX]

[DOI]

Carolin Lunemann

Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010

A generalization of Paillier's public-key system with applications to electronic voting.

[BibT_eX]

[DOI]

Mads Jurik

Int. J. Inf. Sec., 2010

On the Necessary and Sufficient Assumptions for UC Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

From Passive to Covert Security at Low Cost.

[BibT_eX]

[DOI]

Martin Geisler

Zuzana Beerliová-Trubíniová

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On the theoretical gap between synchronous and asynchronous MPC protocols.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries.

[BibT_eX]

[DOI]

Frédéric Dupuis

Louis Salvail

Proceedings of the Advances in Cryptology, 2010

Privacy-enhancing auctions using rational cryptography.

[BibT_eX]

[DOI]

Peter Bro Miltersen

Nikos Triandopoulos

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement.

[BibT_eX]

[DOI]

Matthias Fitzi

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

A Tree Based Method for the Rapid Screening of Chemical Fingerprints.

[BibT_eX]

[DOI]

Thomas Greve Kristensen

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

LEGO for Two-Party Secure Computation.

[BibT_eX]

[DOI]

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

Universally Composable Multiparty Computation with Partially Isolated Parties.

[BibT_eX]

[DOI]

Daniel Wichs

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

Asynchronous Multiparty Computation: Theory and Implementation.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2009

A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees.

[BibT_eX]

[DOI]

Thomas Mailund

Proceedings of the International Joint Conferences on Bioinformatics, 2009

Secure Multiparty Computation Goes Live.

[BibT_eX]

[DOI]

Michael I. Schwartzbach

Tomas Toft

Proceedings of the Financial Cryptography and Data Security, 2009

2008

Privacy-Enhancing First-Price Auctions Using Rational Cryptography.

[BibT_eX]

[DOI]

Peter Bro Miltersen

Nikos Triandopoulos

IACR Cryptol. ePrint Arch., 2008

On the Number of Synchronous Rounds Required for Byzantine Agreement.

[BibT_eX]

[DOI]

Matthias Fitzi

Zuzana Beerliová-Trubíniová

IACR Cryptol. ePrint Arch., 2008

Multiparty Computation Goes Live.

[BibT_eX]

[DOI]

Michael I. Schwartzbach

Tomas Toft

IACR Cryptol. ePrint Arch., 2008

Almost-Asynchronous MPC with Faulty Minority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

SNPFile - A software library and file format for large scale association mapping and population genetics studies.

[BibT_eX]

[DOI]

Thomas Mailund

BMC Bioinform., 2008

OT-Combiners via Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Essentially Optimal Universally Composable Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2008

Asynchronous Multi-Party Computation with Quadratic Communication.

[BibT_eX]

[DOI]

Bartosz Przydatek

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Isolated Proofs of Knowledge and Isolated Zero Knowledge.

[BibT_eX]

[DOI]

Daniel Wichs

Proceedings of the Advances in Cryptology, 2008

Scalable Multiparty Computation with Nearly Optimal Work and Resilience.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Scalable and Unconditionally Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Secure Protocols with Asymmetric Trust.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Simplified Threshold RSA with Adaptive and Proactive Security.

[BibT_eX]

[DOI]

Jesús F. Almansa

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Robust Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

How to Split a Shared Secret into Shared Bits in Constant-Round.

[BibT_eX]

[DOI]