Improved Primitives for Secure Multiparty Integer Computation
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 182-199
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Secure Computation with Fixed-Point Numbers2010
- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation2006
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation2005
- Non-interactive Distributed-Verifier Proofs and Proving Relations among CommitmentsLecture Notes in Computer Science, 2002
- Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products2002
- Multiparty Computation from Threshold Homomorphic Encryption2001
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- A Secure and Optimally Efficient Multi-Authority Election Scheme1997
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988