Selected application of the Chinese remainder theorem in multiparty computation

DOI10.17512/JAMCM.2016.1.04zbMATH Open1464.11140OpenAlexW2520172524MaRDI QIDQ2201218FDOQ2201218

Artur Jakubski

Publication date: 28 September 2020

Published in: Journal of Applied Mathematics and Computational Mechanics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17512/jamcm.2016.1.04

zbMATH Keywords

distributed algorithmssecret sharingmodular arithmeticmultiparty cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• How to share a secret
• Title not available (Why is that?)
• Title not available (Why is that?)
• Several Generalizations of Shamir's Secret Sharing Scheme
• How to Share a Secret
• Elementary symmetric polynomials in Shamir's scheme
• Remarks on the classical threshold secret sharing schemes
• Theory of Cryptography
• Title not available (Why is that?)
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Selected application of the Chinese remainder theorem in multiparty computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201218)