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

Linear, Constant-Rounds Bit-Decomposition

Tord Ingolf Reistad, Tomas Toft

Published Jan 1, 2010• 23 citations
Publisher
DOI
10.1007/978-3-642-14423-3_17

Related papers

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

Tomas Toft

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

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

Tomas Toft

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

Constant-Round Private Function Evaluation with Linear Complexity

Jonathan I. Katz, Lior Malka

Lecture notes in computer science•Jan 1, 2011•49 citations

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Chao Ning, Qiuliang Xu

Lecture notes in computer science•Jan 1, 2011•18 citations

Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity

Huafei Zhu, Feng Bao

Lecture notes in computer science•Jan 1, 2011•4 citations

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum

Kazuma Ohara, Kazuo Ohta, Koutarou Suzuki +1 more

Lecture notes in computer science•Jan 1, 2014•2 citations