The following pages link to (Q4434900):
Displaying 13 items.
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Utility dependence in correct and fair rational secret sharing (Q2429715) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
