Pages that link to "Item:Q514468"

The following pages link to A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468):

Displaying 14 items.

• A discrepancy lower bound for information complexity (Q343867) (← links)
• A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
• A theoretical and empirical evaluation of an algorithm for self-healing computation (Q1682221) (← links)
• Distributed key generation for SM9-based systems (Q2057137) (← links)
• Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
• Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
• On the universal steganography of optimal rate (Q2216130) (← links)
• Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
• Secure multi-party computation in large networks (Q2401120) (← links)
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
• Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
• Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography (Q2953811) (← links)
• Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
• (Q5090444) (← links)