A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity
- 9 December 2020
- book chapter
- Published by Springer Nature
- p. 652-682
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the Complexity of Additively Homomorphic UC Commitments2015
- A Unified Approach to MPC with Preprocessing Using OT2015
- Dishonest Majority Multi-Party Computation for Binary Circuits2014
- Constant-Overhead Secure Computation of Boolean Circuits using PreprocessingLecture Notes in Computer Science, 2013
- A New Approach to Practical Active-Secure Two-Party Computation2012
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Semi-homomorphic Encryption and Multiparty Computation2011
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Universally composable security: a new paradigm for cryptographic protocols2001