The following pages link to Juan A. Garay (Q656917):
Displaying 50 items.
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- (Q785021) (redirect page) (← links)
- SoK: a consensus taxonomy in the blockchain era (Q785022) (← links)
- Consensus from signatures of work (Q785024) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Sharing video on demand (Q1399105) (← links)
- (Q1575648) (redirect page) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- But why does it work? A rational protocol design treatment of bitcoin (Q1648820) (← links)
- Fair distributed computation of reactive functions (Q1664161) (← links)
- The Bitcoin backbone protocol with chains of variable difficulty (Q1675729) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup (Q1753862) (← links)
- Minimal complete primitives for secure multi-party computation (Q1777285) (← links)
- Optimal amortized distributed consensus (Q1898481) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Blockchains from non-idealized hash functions (Q2055724) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- The combinatorics of hidden diversity (Q2297852) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Strengthening zero-knowledge protocols using signatures (Q2499270) (← links)
- Towards efficient private distributed computation on unbounded input streams (Q2515964) (← links)
- How Fair is Your Protocol? (Q2796263) (← links)
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing (Q2942731) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Fast and unconditionally secure anonymous channel (Q2943631) (← links)
- Efficient player-optimal protocols for strong and differential consensus (Q2943757) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- The Bitcoin Backbone Protocol: Analysis and Applications (Q2948386) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Secure Message Transmission With Small Public Discussion (Q2986460) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- Timed Release of Standard Digital Signatures (Q2995370) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Efficient On-Line Call Control Algorithms (Q3128992) (← links)
- Mutual search (Q3158548) (← links)
- Edge Fault Tolerance on Sparse Networks (Q3167034) (← links)
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer (Q3183582) (← links)
- Secure Message Transmission with Small Public Discussion (Q3563835) (← links)
- Improved Fault Tolerance and Secure Computation on Sparse Networks (Q3587443) (← links)
- Towards Optimal and Efficient Perfectly Secure Message Transmission (Q3596386) (← links)
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds (Q4031319) (← links)
- (Q4249641) (← links)
- (Q4250216) (← links)
