Practically efficient secure distributed exponentiation without bit-decomposition

DOI10.1007/978-3-662-58387-6_16zbMATH Open1460.94034OpenAlexW2803747608MaRDI QIDQ2656944FDOQ2656944

Authors: Abdelrahaman Aly, A. Abidin, Svetla Nikova 

Publication date: 17 March 2021

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/661165

Recommendations

• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Efficient secure two-party exponentiation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Efficient two-party exponentiation from quotient transfer
• Amortizing division and exponentiation

This page was built for publication: Practically efficient secure distributed exponentiation without bit-decomposition

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