Paper 2007/346
Secure multi-party computation on incomplete networks
Shailesh Vaya
Abstract
Secure multiparty computation of a multivariate function is a central problem in cryptography. It is known that secure multiparty computation can be realized by a set of
Note: (1) Simplified proof of security with easier to understand structure. (2) More elaborate explaination of the definition of security and how input indistinguishablity type definition is implied by it. (3) Elaborate comparison.
Metadata
- Available format(s)
- -- withdrawn --
- Publication info
- Published elsewhere. No
- Keywords
- simulation paradigmsecure multi-party computation
- Contact author(s)
-
shailesh vaya @ gmail com
vaya @ cse iitm ernet in - History
- 2009-06-23: withdrawn
- 2007-09-05: received
- See all versions
- Short URL
- https://ia.cr/2007/346
- License
-
CC BY