Secure multi-party computation
From MaRDI portal
Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Recommendations
- Secure multiparty computation and secret sharing
- Recent results in scalable multi-party computation
- Multiparty computation, an introduction
- scientific article; zbMATH DE number 1952886
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
Cited in
(25)- Secure multiparty computation and secret sharing
- scientific article; zbMATH DE number 5283568 (Why is no real title available?)
- Secure non-interactive simulation from arbitrary joint distributions
- Secure Multiparty Computation
- Secure Multi-Party Computation for Elliptic Curves
- Perfect secure computation in two rounds
- Secure Multi-party Shuffling
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- scientific article; zbMATH DE number 7267018 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- Efficient secure two-party protocols. Techniques and constructions
- Three-party quantum summation without a trusted third party
- Size-Hiding Computation for Multiple Parties
- Additive randomized encodings from public key encryption
- On the inner product predicate and a generalization of matching vector families
- An equational approach to secure multi-party computation
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Secure non-interactive simulation: feasibility and rate
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
- High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom
- Optimally-fair multi-party exchange without trusted parties
- Secure non-interactive reducibility is decidable
This page was built for publication: Secure multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841734)
