Secure two-party computation with low communication
From MaRDI portal
Recommendations
- Efficient Two-Party Secure Computation on Committed Inputs
- Universally-Composable Two-Party Computation in Two Rounds
- Faster secure two-party computation in the single-execution setting
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure multiparty computation with minimal interaction
Cited in
(41)- The price of low communication in secure multi-party computation
- The hunting of the SNARK
- Secure computation with low communication from cross-checking
- Witness indistinguishability for any single-round argument with applications to access control
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Succinct non-interactive arguments via linear interactive proofs
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Communication optimal Tardos-based asymmetric fingerprinting
- Cryptographic assumptions: a position paper
- Rational sumchecks
- The feasibility of outsourced database search in the plain model
- On the existence of extractable one-way functions
- On constant-round concurrent zero-knowledge from a knowledge assumption
- Delegating RAM Computations
- Arguments of proximity (extended abstract)
- Covert two-party computation
- Refereed delegation of computation
- Two-Prover Protocols---Low Error at Affordable Rates
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Constant-round interactive proofs for delegating computation
- The bottleneck complexity of secure multiparty computation
- Toward RSA-OAEP without random oracles
- On the bottleneck complexity of MPC with correlated randomness
- Lattice-based SNARGs and their application to more efficient obfuscation
- No-signaling linear PCPs
- No-signaling linear PCPs
- Sublinear-communication secure multiparty computation does not require FHE
- Non-interactive publicly-verifiable delegation of committed programs
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Sublinear secure computation from new assumptions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive zero-knowledge from non-interactive batch arguments
- A simple and efficient framework of proof systems for NP
- 10-party sublinear secure computation from standard assumptions
- Adaptive security in SNARGs via iO and lossy functions
- Batching adaptively-sound SNARGs for NP
- Homomorphic secret sharing with verifiable evaluation
- A note on low-communication secure multiparty computation via circuit depth-reduction
This page was built for publication: Secure two-party computation with low communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891476)
