VIFF

swMATH5804MaRDI QIDQ17943FDOQ17943

Author name not available (Why is that?)

Described by source

• Asynchronous Multiparty Computation: Theory and Implementation

Cited In (13)

• On the exact round complexity of secure three-party computation
• Generic Constant-Round Oblivious Sorting Algorithm for MPC
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing
• Secure Multiparty AES
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Rate-limited secure function evaluation
• Cryptographic algorithms for privacy-preserving online applications
• High-Precision Secure Computation of Satellite Collision Probabilities
• Secure Outsourced Computation
• Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
• Secure multi-party computation in large networks
• Actively secure setup for SPDZ

This page was built for software: VIFF