Pages that link to "Item:Q2891476"
From MaRDI portal
The following pages link to Secure Two-Party Computation with Low Communication (Q2891476):
Displaying 35 items.
- Refereed delegation of computation (Q385709) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Rational Sumchecks (Q2799100) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Covert two-party computation (Q3581447) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- The bottleneck complexity of secure multiparty computation (Q5002694) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
- Adaptive security in SNARGs via iO and lossy functions (Q6660293) (← links)
