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

DOI10.1007/978-3-642-00862-7_24zbMath1237.94096OpenAlexW1516531644MaRDI QIDQ3623058

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

secret sharingbit-decompositionconstant-rounds multi-party computation

Mathematics Subject Classification ID

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

Related Items (1)

Function secret sharing for mixed-mode and fixed-point secure computation

Cites Work

• How to share a secret
• Efficient Binary Conversion for Paillier Encrypted Values
• Advances in Cryptology - CRYPTO 2003
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography
• Unnamed Item

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