Pages that link to "Item:Q2822679"
From MaRDI portal
The following pages link to Better Preprocessing for Secure Multiparty Computation (Q2822679):
Displaying 14 items.
- Preface (to the special issue on general secure multiparty computation) (Q1976001) (← links)
- More efficient post-quantum KEMTLS with pre-distributed public keys (Q2146154) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Towards practical topology-hiding computation (Q6135413) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)