An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks

DOI10.1007/978-3-030-57808-4_18OpenAlexW3081594060MaRDI QIDQ2229283FDOQ2229283

Authors: Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida 

Publication date: 23 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_18

Recommendations

• Improved primitives for secure multiparty integer computation
• A new approach to efficient and secure fixed-point computation
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority

zbMATH Keywords

secure multi-party computationconstant-round protocolsclient-aided modeldivision protocol

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cites Work

• Multiparty Computation from Somewhat Homomorphic Encryption
• Foundations of Cryptography
• Title not available (Why is that?)
• Encrypted integer division and secure comparison
• Fast large-scale honest-majority MPC for malicious adversaries
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Improved primitives for secure multiparty integer computation
• Theory of Cryptography
• Title not available (Why is that?)
• Constant-round client-aided secure comparison protocol
• Automatic protocol selection in secure two-party computations
• Communication-efficient (client-aided) secure two-party protocols and its application

Cited In (1)

• A new approach to efficient and secure fixed-point computation

This page was built for publication: An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks

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