The following pages link to (Q4250770):
Displaying 37 items.
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Dynamic threshold secret reconstruction and its application to the threshold cryptography (Q2353654) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Adaptively Secure Non-interactive Threshold Cryptosystems (Q3012950) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Secure Protocols with Asymmetric Trust (Q3498386) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks (Q3616571) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Efficient Simultaneous Broadcast (Q5445453) (← links)
- A Single Initialization Server for Multi-party Cryptography (Q5502793) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Computations with a deck of cards (Q5941300) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Lightweight noninteractive membership authentication and group key establishment for WSNs (Q6534699) (← links)
- Network agnostic MPC with statistical security (Q6582167) (← links)
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS (Q6637549) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
