Selected application of the Chinese remainder theorem in multiparty computation
From MaRDI portal
Publication:2201218
DOI10.17512/JAMCM.2016.1.04zbMATH Open1464.11140OpenAlexW2520172524MaRDI QIDQ2201218FDOQ2201218
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1122449
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Chinesische Reste und moderne Kryptographie
- A note on secure multiparty computation via higher residue symbols
- Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
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)
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)