Pages that link to "Item:Q2304915"

The following pages link to Zero-knowledge proofs on secret-shared data via fully linear PCPs (Q2304915):

Displaying 33 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)
• Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
• MPClan: protocol suite for privacy-conscious computations (Q6110388) (← 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)
• MPC with delayed parties over star-like networks (Q6595681) (← links)
• VSS from distributed ZK proofs and applications (Q6595689) (← links)
• The price of active security in cryptographic protocols (Q6595846) (← links)
• ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\) (Q6595940) (← links)
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
• Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)
• Sometimes you can't distribute random-oracle-based proofs (Q6652973) (← links)
• MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
• An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← links)