Secure Two-Party Computation with Low Communication
From MaRDI portal
Publication:2891476
DOI10.1007/978-3-642-28914-9_4zbMath1303.94076OpenAlexW174102541MaRDI QIDQ2891476
Carmit Hazay, Sebastian Faust, Ivan B. Damgård
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_4
Related Items (31)
Toward RSA-OAEP Without Random Oracles ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Arguments of Proximity ⋮ Delegating RAM Computations ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Refereed delegation of computation ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ 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 ⋮ Unnamed Item ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ The hunting of the SNARK ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ No-signaling linear PCPs ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Cryptographic Assumptions: A Position Paper ⋮ No-signaling linear PCPs ⋮ Rational Sumchecks ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ On the Existence of Extractable One-Way Functions ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
This page was built for publication: Secure Two-Party Computation with Low Communication
