Dishonest Majority Multi-Party Computation for Binary Circuits
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 495-512
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- More efficient oblivious transfer and extensions for faster secure computation2013
- Constant-Overhead Secure Computation of Boolean Circuits using PreprocessingLecture Notes in Computer Science, 2013
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits2013
- MiniLEGO: Efficient Secure Two-Party Computation from General AssumptionsLecture Notes in Computer Science, 2013
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- How to Garble Arithmetic Circuits2011
- Semi-homomorphic Encryption and Multiparty Computation2011
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Universally composable security: a new paradigm for cryptographic protocols2001
- How to play ANY mental game1987