Efficient secure two-party exponentiation
From MaRDI portal
Publication:3073692
Recommendations
- Efficient two-party exponentiation from quotient transfer
- Secure multiplication of shared secrets in the exponent
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Two-round multiparty secure computation minimizing public key operations
- Faster secure two-party computation in the single-execution setting
Cites work
- scientific article; zbMATH DE number 1942435 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Privacy preserving data mining
- Public Key Cryptography - PKC 2006
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure Arithmetic Computation with No Honest Majority
- Secure multiparty computation goes live
- Theory of Cryptography
- Theory of Cryptography
Cited in
(6)- Amortizing division and exponentiation
- Practically efficient secure distributed exponentiation without bit-decomposition
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Two-party ECDSA from hash proof systems and efficient instantiations
- Secure multiplication of shared secrets in the exponent
- Efficient two-party exponentiation from quotient transfer
This page was built for publication: Efficient secure two-party exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073692)
