Efficient bit-decomposition and modulus-conversion protocols with an honest majority

DOI10.1007/978-3-319-93638-3_5MaRDI QIDQ1784437zbMATH OpenOpenAlexFDO

Authors Ryo Kikuchi, Dai Ikarashi, Takahiro Matsuda, Koki Hamada, Koji Chida

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93638-3_5

zbMATH Keywords

secret sharingsecure computationbit decompositionhonest majoritymodulus conversion

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• 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
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Theory of Cryptography

Cited in

(4)

• Efficient two-party exponentiation from quotient transfer
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings

This page was built for publication: Efficient bit-decomposition and modulus-conversion protocols with an honest majority

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