| Publication | Date of Publication | Type |
|---|
Towards permissionless consensus in the standard model via fine-grained complexity
| 2024-12-04 | Paper |
Proof-of-work-based consensus in expected-constant time
| 2024-11-13 | Paper |
Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
| 2024-08-15 | Paper |
Fast, long-lived renaming improved and simplified
| 2024-07-11 | Paper |
Universally composable almost-everywhere secure computation
| 2024-06-25 | Paper |
Completeness theorems for adaptively secure broadcast
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Permissionless clock synchronization with public setup
Theory of Cryptography | 2023-08-14 | Paper |
Adaptive Video on Demand
Lecture Notes in Computer Science | 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
Journal of Cryptology | 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
Theoretical Computer Science | 2020-02-20 | Paper |
Probabilistic termination and composability of cryptographic protocols
Journal of Cryptology | 2019-08-13 | Paper |
Perennial secure multi-party computation of universal Turing machine
Theoretical Computer Science | 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: Secure self-stabilizing computation
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Long-lived renaming made fast
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
The hidden graph model: communication locality and optimal resiliency with adaptive faults
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Secure Message Transmission With Small Public Discussion
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Resource-based corruptions and the combinatorics of hidden diversity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Constant-round asynchronous multi-party computation based on one-way functions
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Probabilistic Termination and Composability of Cryptographic Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
On the implausibility of constant-round public-coin zero-knowledge proofs
Lecture Notes in Computer Science | 2016-10-21 | Paper |
How fair is your protocol? A utility-based approach to protocol optimality
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Almost-everywhere secure computation with edge corruptions
Journal of Cryptology | 2016-01-11 | Paper |
The Bitcoin Backbone Protocol: Analysis and Applications
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Broadcast (and round) efficient verifiable secret sharing
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Fast and unconditionally secure anonymous channel
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Towards efficient private distributed computation on unbounded input streams
Journal of Mathematical Cryptology | 2015-08-07 | Paper |
A little honesty goes a long way. The two-tier model for secure multiparty computation
Theory of Cryptography | 2015-07-06 | Paper |
Fully polynomial Byzantine agreement in t + 1 rounds
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
On the complexity of UC commitments
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Edge Fault Tolerance on Sparse Networks
Automata, Languages, and Programming | 2012-11-01 | Paper |
Resource fairness and composability of cryptographic protocols
Journal of Cryptology | 2012-01-13 | Paper |
Secure message transmission by public discussion: a brief survey
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Timed release of standard digital signatures (extended abstract)
Financial Cryptography | 2011-04-20 | Paper |
Improved fault tolerance and secure computation on sparse networks
Automata, Languages and Programming | 2010-09-07 | Paper |
Secure message transmission with small public discussion
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Timed fair exchange of standard signatures (extended abstract)
Lecture Notes in Computer Science | 2010-03-31 | Paper |
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Almost-Everywhere Secure Computation
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Practical and Secure Solutions for Integer Comparison
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Towards Optimal and Efficient Perfectly Secure Message Transmission
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Strengthening zero-knowledge protocols using signatures
Journal of Cryptology | 2006-08-14 | Paper |
Minimal complete primitives for secure multi-party computation
Journal of Cryptology | 2005-05-13 | Paper |
Mutual search
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2009955 (Why is no real title available?)
| 2003-11-26 | Paper |
Sharing video on demand
Discrete Applied Mathematics | 2003-07-30 | Paper |
scientific article; zbMATH DE number 1848306 (Why is no real title available?)
| 2003-07-10 | Paper |
scientific article; zbMATH DE number 1759788 (Why is no real title available?)
| 2002-10-07 | Paper |
scientific article; zbMATH DE number 1418311 (Why is no real title available?)
| 2000-08-24 | Paper |
Secure distributed storage and retrieval
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1303126 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1303590 (Why is no real title available?)
| 1999-06-17 | Paper |
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing | 1998-05-10 | Paper |
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
SIAM Journal on Computing | 1998-05-10 | Paper |
Efficient On-Line Call Control Algorithms
Journal of Algorithms | 1997-04-27 | Paper |
Fast consensus in networks of bounded degree.
Distributed Computing | 1995-11-22 | Paper |
Optimal amortized distributed consensus
Information and Computation | 1995-10-29 | Paper |
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
Mathematical Systems Theory | 1993-04-01 | Paper |
