Communication preserving protocols for secure function evaluation

DOI10.1145/380752.380855zbMATH Open1323.68317OpenAlexW2069717895MaRDI QIDQ5176017FDOQ5176017

Authors: Moni Naor, Kobbi Nissim 

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

Recommendations

• On the communication complexity of secure function evaluation with long output
• Communication protocols for secure distributed computation of binary functions.
• Minimal-latency secure function evaluation
• Actively Secure Private Function Evaluation
• Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
• On Function Computation With Privacy and Secrecy Constraints
• Rate-limited secure function evaluation: definitions and constructions
• Rate-limited secure function evaluation
• Designing fully secure protocols for secure two-party computation of constant-domain functions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (42)

• Communication protocols for secure distributed computation of binary functions.
• Communication-Efficient Private Protocols for Longest Common Subsequence
• Two Party Distribution Testing: Communication and Security
• Communication optimal Tardos-based asymmetric fingerprinting
• On the communication required for unconditionally secure multiplication
• Information Security and Cryptology
• Secure computation from millionaire
• Fast Private Norm Estimation and Heavy Hitters
• Title not available (Why is that?)
• Efficient set operations in the presence of malicious adversaries
• Sublinear-communication secure multiparty computation does not require FHE
• Breaking the circuit size barrier for secure computation under DDH
• On the communication complexity of secure function evaluation with long output
• Cryptography and cryptographic protocols
• Secure multiparty computation with sublinear preprocessing
• On the bottleneck complexity of MPC with correlated randomness
• Sublinear secure computation from new assumptions
• Maliciously secure massively parallel computation for all-but-one corruptions
• Private multiparty sampling and approximation of vector combinations
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Theory and Applications of Models of Computation
• The bottleneck complexity of secure multiparty computation
• Statistical Security Conditions for Two-Party Secure Function Evaluation
• Multi-value private information retrieval with colluding databases via trace functions
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Succinct homomorphic secret sharing
• Title not available (Why is that?)
• Actively Secure Private Function Evaluation
• Secure circuit evaluation. A protocol based on hiding information from an oracle
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Sub-linear, secure comparison with two non-colluding parties
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• 10-party sublinear secure computation from standard assumptions
• The hunting of the SNARK
• A balm: defend the clique-based attack from a fundamental aspect
• Minimal-latency secure function evaluation
• Secure computation of the median (and other elements of specified ranks)
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Secure multiparty computation without one-way functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176017)