Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 445-465
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems2009
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2006
- Scalable Secure Multiparty Computation2006
- Short PCPs Verifiable in Polylogarithmic Time2005
- Multiparty Computation from Threshold Homomorphic Encryption2001
- Universally composable security: a new paradigm for cryptographic protocols2001
- Multiparty unconditionally secure protocols1988
- An O (log n ) expected rounds randomized byzantine generals protocolJournal of the ACM, 1987
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964