Multi-party computation with conversion of secret sharing

DOI10.1007/S10623-011-9515-ZzbMATH Open1234.68151OpenAlexW1970848480WikidataQ59484975 ScholiaQ59484975MaRDI QIDQ664384FDOQ664384

Authors: Hossein Ghodosi, Josef Pieprzyk, Ron Steinfeld 

Publication date: 1 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/69331/7/22105_Ghodosi_etal_2012GreenOA.pdf

Recommendations

• Applied Cryptography and Network Security
• General secure multi-party computation from any linear secret-sharing scheme
• Scalable and Unconditionally Secure Multiparty Computation
• Progress in Cryptology - INDOCRYPT 2003
• On \(d\)-multiplicative secret sharing

zbMATH Keywords

unconditional securitymulti-party computationhybrid secret sharing schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• Foundations of Cryptography
• An explication of secret sharing schemes
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Title not available (Why is that?)
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Theory of Cryptography
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Title not available (Why is that?)
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Scalable Secure Multiparty Computation
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

Cited In (16)

• Atomic Secure Multi-party Multiplication with Low Communication
• Applied Cryptography and Network Security
• Field extension in secret-shared form and its applications to efficient secure computation
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
• Distributing any elliptic curve based protocol
• Multi-Party Secure Computation of Multi-Variable Polynomials
• Homomorphic extensions of CRT-based secret sharing
• Secure multi-party computation with a quantum manner
• Secret sharing comparison by transformation and rotation
• Scalable multiparty computation from non-linear secret sharing
• Public Key Cryptography - PKC 2006
• Secret sharing schemes with conversion protocol to achieve short share-size and extendibility to multiparty computation
• Theory of Cryptography
• Theory of Cryptography
• Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}

This page was built for publication: Multi-party computation with conversion of secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664384)