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

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Constant-round client-aided secure comparison protocol
• Communication-efficient (client-aided) secure two-party protocols and its application
• Multiparty Computation from Somewhat Homomorphic Encryption
• Improved Primitives for Secure Multiparty Integer Computation
• Foundations of Cryptography
• Automatic Protocol Selection in Secure Two-Party Computations
• Theory of Cryptography

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