Communication preserving protocols for secure function evaluation
From MaRDI portal
(Redirected from Publication:5176017)
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
Cites work
Cited in
(42)- Private multiparty sampling and approximation of vector combinations
- The hunting of the SNARK
- Communication protocols for secure distributed computation of binary functions.
- 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
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
- scientific article; zbMATH DE number 1617945 (Why is no real title available?)
- Communication optimal Tardos-based asymmetric fingerprinting
- Secure computation from millionaire
- On the communication required for unconditionally secure multiplication
- Breaking the circuit size barrier for secure computation under DDH
- Actively Secure Private Function Evaluation
- On the communication complexity of secure function evaluation with long output
- Sub-linear, secure comparison with two non-colluding parties
- Minimal-latency secure function evaluation
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Communication-Efficient Private Protocols for Longest Common Subsequence
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- Efficient set operations in the presence of malicious adversaries
- The bottleneck complexity of secure multiparty computation
- On the bottleneck complexity of MPC with correlated randomness
- Two Party Distribution Testing: Communication and Security
- Cryptography and cryptographic protocols
- Secure multiparty computation without one-way functions
- Fast Private Norm Estimation and Heavy Hitters
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
- Statistical Security Conditions for Two-Party Secure Function Evaluation
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Information Security and Cryptology
- Theory and Applications of Models of Computation
- Secure computation of the median (and other elements of specified ranks)
- 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
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Succinct homomorphic secret sharing
- 10-party sublinear secure computation from standard assumptions
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Secure circuit evaluation. A protocol based on hiding information from an oracle
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)
