Publication | Date of Publication | Type |
---|
Completeness theorems for adaptively secure broadcast | 2024-02-02 | Paper |
Permissionless clock synchronization with public setup | 2023-08-14 | Paper |
Adaptive Video on Demand | 2023-05-08 | Paper |
Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era | 2022-03-23 | Paper |
Broadcast-optimal two-round MPC | 2022-03-23 | Paper |
Blockchains from non-idealized hash functions | 2021-12-01 | Paper |
Round-preserving parallel composition of probabilistic-termination cryptographic protocols | 2021-06-28 | Paper |
SoK: a consensus taxonomy in the blockchain era | 2020-08-05 | Paper |
Consensus from signatures of work | 2020-08-05 | Paper |
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols | 2020-05-27 | Paper |
The combinatorics of hidden diversity | 2020-02-20 | Paper |
Probabilistic termination and composability of cryptographic protocols | 2019-08-13 | Paper |
Perennial secure multi-party computation of universal Turing machine | 2019-04-23 | Paper |
Fair distributed computation of reactive functions | 2018-08-24 | Paper |
But why does it work? A rational protocol design treatment of bitcoin | 2018-07-09 | Paper |
Bootstrapping the blockchain, with applications to consensus and fast PKI setup | 2018-05-29 | Paper |
The Bitcoin backbone protocol with chains of variable difficulty | 2017-11-03 | Paper |
The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
Brief Announcement | 2017-10-11 | Paper |
Long-lived renaming made fast | 2017-09-29 | Paper |
The Hidden Graph Model | 2017-05-19 | Paper |
Secure Message Transmission With Small Public Discussion | 2017-05-16 | Paper |
Resource-based corruptions and the combinatorics of hidden diversity | 2017-05-16 | Paper |
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions | 2017-01-06 | Paper |
Probabilistic Termination and Composability of Cryptographic Protocols | 2016-11-09 | Paper |
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs | 2016-10-21 | Paper |
How Fair is Your Protocol? | 2016-03-23 | Paper |
Almost-everywhere secure computation with edge corruptions | 2016-01-11 | Paper |
Broadcast (and Round) Efficient Verifiable Secret Sharing | 2015-09-30 | Paper |
The Bitcoin Backbone Protocol: Analysis and Applications | 2015-09-30 | Paper |
Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing | 2015-09-11 | Paper |
Adaptively secure broadcast, revisited | 2015-09-11 | Paper |
Efficient player-optimal protocols for strong and differential consensus | 2015-09-04 | Paper |
Fast and unconditionally secure anonymous channel | 2015-09-03 | Paper |
Towards efficient private distributed computation on unbounded input streams | 2015-08-07 | Paper |
A Little Honesty Goes a Long Way | 2015-07-06 | Paper |
Fully polynomial Byzantine agreement in t + 1 rounds | 2015-05-07 | Paper |
On the Complexity of UC Commitments | 2014-05-27 | Paper |
Edge Fault Tolerance on Sparse Networks | 2012-11-01 | Paper |
Resource fairness and composability of cryptographic protocols | 2012-01-13 | Paper |
Secure Message Transmission by Public Discussion: A Brief Survey | 2011-06-08 | Paper |
Timed Release of Standard Digital Signatures | 2011-04-20 | Paper |
Improved Fault Tolerance and Secure Computation on Sparse Networks | 2010-09-07 | Paper |
Secure Message Transmission with Small Public Discussion | 2010-06-01 | Paper |
Computer Aided Verification | 2010-03-31 | Paper |
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer | 2009-10-20 | Paper |
Theory of Cryptography | 2009-05-14 | Paper |
Almost-Everywhere Secure Computation | 2008-04-15 | Paper |
Practical and Secure Solutions for Integer Comparison | 2007-09-04 | Paper |
Towards Optimal and Efficient Perfectly Secure Message Transmission | 2007-08-30 | Paper |
Theory of Cryptography | 2007-02-12 | Paper |
Theory of Cryptography | 2007-02-12 | Paper |
Strengthening zero-knowledge protocols using signatures | 2006-08-14 | Paper |
Minimal complete primitives for secure multi-party computation | 2005-05-13 | Paper |
Mutual search | 2005-01-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4434875 | 2003-11-26 | Paper |
Sharing video on demand | 2003-07-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785498 | 2003-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4536811 | 2002-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4941873 | 2000-08-24 | Paper |
Secure distributed storage and retrieval | 2000-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4249641 | 1999-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250216 | 1999-06-17 | Paper |
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds | 1998-05-10 | Paper |
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees | 1998-05-10 | Paper |
Efficient On-Line Call Control Algorithms | 1997-04-27 | Paper |
Fast consensus in networks of bounded degree. | 1995-11-22 | Paper |
Optimal amortized distributed consensus | 1995-10-29 | Paper |
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds | 1993-04-01 | Paper |