Communication preserving protocols for secure function evaluation

DOI10.1145/380752.380855zbMath1323.68317MaRDI QIDQ5176017

Kobbi Nissim, Moni Naor

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

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

68M12: Network protocols

94A62: Authentication, digital signatures and secret sharing

Related Items

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

Cites Work

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