Communication preserving protocols for secure function evaluation

DOI10.1145/380752.380855zbMath1323.68317OpenAlexW2069717895MaRDI QIDQ5176017

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380855

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (23)

Secure multiparty computation with sublinear preprocessing ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ Sublinear secure computation from new assumptions ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Unnamed Item ⋮ The hunting of the SNARK ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Cryptography and cryptographic protocols ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Two Party Distribution Testing: Communication and Security ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ A balm: defend the clique-based attack from a fundamental aspect

Cites Work

A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Communication preserving protocols for secure function evaluation