Efficient two-party exponentiation from quotient transfer
From MaRDI portal
Publication:2096636
DOI10.1007/978-3-031-09234-3_32OpenAlexW4285299399MaRDI QIDQ2096636
Keisuke Tanaka, Keisuke Hara, Yi Lu, Kazuma Ohara, Jacob C. N. Schuldt
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_32
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Uses Software
Cites Work
- Unnamed Item
- Overdrive: making SPDZ great again
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority
- Practically efficient secure distributed exponentiation without bit-decomposition
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Information-Theoretically Secure Protocols and Security under Composition
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Practical Distributed Signatures in the Standard Model
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Fast secure two-party ECDSA signing
This page was built for publication: Efficient two-party exponentiation from quotient transfer
