Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Constant-rounds, almost-linear bit-decomposition of secret shared values

Tomas Toft

Published Jan 1, 2009• 1 citation
OpenAlex

Related papers

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

Tomas Toft

Lecture notes in computer science•Jan 1, 2009•33 citations

Linear, Constant-Rounds Bit-Decomposition

Tord Ingolf Reistad, Tomas Toft

Lecture notes in computer science•Jan 1, 2010•23 citations

Constant-round reconstruction for rational secret sharing

Akinori Kawachi, Yoshio Okamoto, Tanaka Keisuke +1 more

IEICE Technical Report; IEICE Tech. Rep.•Nov 26, 2010•0 citations

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction

KEISUKE TANAKA, 亮周 河内, Akinori Kawachi +2 more

•Dec 1, 2016•0 citations

Provable Secure Constant-Round Group Key Agreement Protocol Based on Secret Sharing

Ruxandra F. Olimid

Advances in intelligent systems and computing•Aug 8, 2013•3 citations

Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison

Takashi Nishide, Kazuo Ohta

We propose constant-round protocols for interval tests, equality tests, and comparisons where shared secret inputs are not given bitwise. In [9]. Damgard et al. presented a novel protocol called the bit-decomposition, which can convert a polynomial sharing of an element in prime field p into sharings of bits. Though, by using the bit-decomposition protocol, those protocols can be constructed with constant round complexities theoretically, it involves expensive computation, leading to relatively high round and communication complexities. In this paper, we construct more efficient protocols for those protocols without relying on the bit-decomposition protocol. In the interval test protocol, checking whether a shared secret exists in the known interval is reduced to checking whether a bitwise-shared random secret exists in the appropriate interval. In the comparison protocol, comparing two shared secrets is reduced to comparing the two secrets via p/2 indirectly where p is an odd prime for an underlying linear secret sharing scheme. In the equality test protocol, checking whether two shared secrets are equal is reduced to checking whether the difference of the two secrets is zero and furthermore checking whether the difference is a zero is reduced to checking quadratice residuosity of a random secret in a probabilistic way.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 1, 2007•12 citations
We propose constant-round protocols for interval tests, equality tests, and comparisons where shared secret inputs are not given bitwise. In [9]. Damgard et al. presented a novel protocol called the bit-decomposition, which can convert a polynomial sharing of an element in prime field p into sharings of bits. Though, by using the bit-decomposition protocol, those protocols can be constructed with constant round complexities theoretically, it involves expensive computation, leading to relatively high round and communication complexities. In this paper, we construct more efficient protocols for those protocols without relying on the bit-decomposition protocol. In the interval test protocol, checking whether a shared secret exists in the known interval is reduced to checking whether a bitwise-shared random secret exists in the appropriate interval. In the comparison protocol, comparing two shared secrets is reduced to comparing the two secrets via p/2 indirectly where p is an odd prime for an underlying linear secret sharing scheme. In the equality test protocol, checking whether two shared secrets are equal is reduced to checking whether the difference of the two secrets is zero and furthermore checking whether the difference is a zero is reduced to checking quadratice residuosity of a random secret in a probabilistic way.