Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values

DOI10.1007/978-3-642-00862-7_24MaRDI QIDQ3623058zbMATH OpenOpenAlexFDO

Authors Tomas Toft

Publication date 29 April 2009

Published in Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00862-7_24

zbMATH Keywords

bit-decompositionconstant-rounds multi-party computationsecret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Theory of Cryptography
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Efficient bit-decomposition and modulus-conversion protocols with an honest majority

Cites work

• Advances in Cryptology - CRYPTO 2003
• Efficient Binary Conversion for Paillier Encrypted Values
• How to share a secret
• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography

Cited in

(8)

• Efficient bit-decomposition and modulus-conversion protocols with an honest majority
• Function secret sharing for mixed-mode and fixed-point secure computation
• Practically efficient secure distributed exponentiation without bit-decomposition
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Theory of Cryptography
• Constant-round linear-broadcast secure computation with penalties

This page was built for publication: Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values

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