Amortizing division and exponentiation
From MaRDI portal
Publication:6134018
DOI10.1007/978-3-031-26553-2_10MaRDI QIDQ6134018
Shuaishuai Li, Dong-Dai Lin, Cong Zhang
Publication date: 21 August 2023
Published in: Information Security and Cryptology (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Overdrive: making SPDZ great again
- Secure arithmetic computation with constant computational overhead
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Efficient pseudorandom correlation generators: silent OT extension and more
- Practically efficient secure distributed exponentiation without bit-decomposition
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Semi-homomorphic Encryption and Multiparty Computation
- Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
- Efficient Secure Two-Party Exponentiation
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Secure Multiparty Computation Goes Live
- Foundations of Cryptography
- Oblivious Polynomial Evaluation
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Theory of Cryptography
- Privacy preserving data mining
This page was built for publication: Amortizing division and exponentiation
