Pages that link to "Item:Q2691587"
From MaRDI portal
The following pages link to Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587):
Displaying 25 items.
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Efficient compiler to covert security with public verifiability for honest majority MPC (Q2096640) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- On Efficient Zero-Knowledge PCPs (Q2891481) (← links)
- Efficient Proofs of Secure Erasure (Q2922679) (← links)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting (Q5402970) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications (Q6595675) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
