Multi-party computation with conversion of secret sharing

DOI10.1007/S10623-011-9515-ZMaRDI QIDQ664384zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1583776 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 1302842 (Why is no real title available?)
• scientific article; zbMATH DE number 1303136 (Why is no real title available?)
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• scientific article; zbMATH DE number 1559560 (Why is no real title available?)
• scientific article; zbMATH DE number 1842487 (Why is no real title available?)
• scientific article; zbMATH DE number 1848306 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• An explication of secret sharing schemes
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• How to share a secret
• Scalable Secure Multiparty Computation
• Secure Arithmetic Computation with No Honest Majority
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Theory of Cryptography
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

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
• Homomorphic extensions of CRT-based secret sharing
• Multi-Party Secure Computation of Multi-Variable Polynomials
• Secure multi-party computation with a quantum manner
• Secret sharing comparison by transformation and rotation
• Scalable multiparty computation from non-linear secret sharing
• Secret sharing schemes with conversion protocol to achieve short share-size and extendibility to multiparty computation
• Public Key Cryptography - PKC 2006
• 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)