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

IEICE Technical Report; IEICE Tech. Rep.

Constant-round reconstruction for rational secret sharing

Akinori Kawachi, Yoshio Okamoto, Tanaka Keisuke, Kenji Yasunaga

Published Nov 26, 2010• 0 citations
OpenAlex

Related papers

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

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

•Dec 1, 2016•0 citations

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

Tomas Toft

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

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

Tomas Toft

Lecture notes in computer science•Jan 1, 2009•1 citation

Achieving Correctness in Fair Rational Secret Sharing

Sourya Joyee De, Asim K. Pal

Lecture notes in computer science•Jan 1, 2013•6 citations

Rational Secret Sharing, Revisited

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2006•187 citations

Efficient Rational Secret Sharing in Standard Communication Networks

Georg Fuchsbauer, Jonathan I. Katz, David Naccache

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