Pages that link to "Item:Q3102211"
From MaRDI portal
The following pages link to Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security (Q3102211):
Displaying 5 items.
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority (Q1784437) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- Selected application of the Chinese remainder theorem in multiparty computation (Q2201218) (← links)
- Theory of Cryptography (Q5898360) (← links)
- Constant-round linear-broadcast secure computation with penalties (Q6041674) (← links)