The following pages link to Vassilis Zikas (Q1648819):
Displaying 39 items.
- But why does it work? A rational protocol design treatment of bitcoin (Q1648820) (← links)
- Fair distributed computation of reactive functions (Q1664161) (← links)
- Bitcoin as a transaction ledger: a composable treatment (Q1675730) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Secure two-party computation over unreliable channels (Q1796811) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Universal composition with global subroutines: capturing global setup within plain UC (Q2119067) (← links)
- A rational protocol treatment of 51\% attacks (Q2128984) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger (Q2697878) (← links)
- Etherless Ethereum Tokens: simulating native tokens in Ethereum (Q2698288) (← links)
- How Fair is Your Protocol? (Q2796263) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Secure Multi-Party Computation with Identifiable Abort (Q2874547) (← links)
- Efficient Three-Party Computation from Cut-and-Choose (Q2874556) (← links)
- Collusion-Preserving Computation (Q2914257) (← links)
- Distributing the setup in universally composable multi-party computation (Q2943608) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Byzantine Agreement with a Rational Adversary (Q3167044) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Adaptively Secure Broadcast (Q3563851) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Realistic Failures in Secure Multi-party Computation (Q3611772) (← links)
- Provably Secure Virus Detection: Using The Observer Effect Against Malware. (Q4598168) (← links)
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World (Q4910283) (← links)
- Universally Composable Synchronous Computation (Q4910294) (← links)
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols (Q5111368) (← links)
- MPC vs. SFE: Perfect Security in a Unified Corruption Model (Q5445509) (← links)
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger (Q5739220) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Universally composable almost-everywhere secure computation (Q6561696) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
