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

DOI10.1007/978-3-642-25385-0_31zbMath1227.94059OpenAlexW59556450MaRDI QIDQ3102211

Qiuliang Xu, Chao Ning

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_31

zbMATH Keywords

ExponentiationLinearBit-DecompositionConstant-RoundsModulo ReductionMulti-party ComputationPerfectly Secure

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Amortizing division and exponentiation ⋮ Selected application of the Chinese remainder theorem in multiparty computation ⋮ Efficient two-party exponentiation from quotient transfer

This page was built for publication: Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security