Pages that link to "Item:Q2304915"
From MaRDI portal
The following pages link to Zero-knowledge proofs on secret-shared data via fully linear PCPs (Q2304915):
Displayed 27 items.
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Banquet: short and fast signatures from AES (Q2061922) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← 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)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- \textsc{SuperPack}: dishonest majority MPC with constant online communication (Q6061359) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Prio+: privacy preserving aggregate statistics via Boolean shares (Q6134840) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Arithmetic sketching (Q6186591) (← links)