Secure multiparty computation and secret sharing
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Recommendations
Cited in
(89)- The complete weight enumerator of the square of one-weight irreducible cyclic codes
- Being Bayesian in the 2020s: opportunities and challenges in the practice of modern applied Bayesian statistics
- Probabilistic secret sharing
- scientific article; zbMATH DE number 7559096 (Why is no real title available?)
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Generalized fuzzy password-authenticated key exchange from error correcting codes
- Secure multi-party quantum computation with a dishonest majority
- Squares of matrix-product codes
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Secure multi-party SM2 signature based on SPDZ protocol
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Secure Multi-Party Computation for Elliptic Curves
- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Complexity and performance of secure floating-point polynomial evaluation protocols
- Cutting-edge cryptography through the lens of secret sharing
- Oblivious transfer in incomplete networks
- Secure Multi-party Shuffling
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- On the square code of group codes
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- Data and Applications Security XIX
- Improved single-round secure multiplication using regenerating codes
- Secure computation with preprocessing via function secret sharing
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- scientific article; zbMATH DE number 7267018 (Why is no real title available?)
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Secure multiparty computation with sublinear preprocessing
- Secure outsourced computation
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Complete characterization of broadcast and pseudo-signatures from correlations
- Efficient secure two-party protocols. Techniques and constructions
- Distributed computing meets game theory
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- ZK-PCPs from leakage-resilient secret sharing
- Threshold secret sharing requires a linear-size alphabet
- Perfect MPC over layered graphs
- On achieving ``best-in-the-multiverse MPC
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- Lattice-based homomorphic encryption for distributed privacy protection
- Size-Hiding Computation for Multiple Parties
- A note on secure multiparty computation via higher residue symbols
- On the construction of a semantically secure modification of the McEliece cryptosystem
- Secure Multiparty AES
- Some new classes of additive MDS and almost MDS codes over finite fields
- Secure multi-party computation
- The arithmetic codex: theory and applications. (Abstract)
- Considerate ramp secret sharing
- Theory of Cryptography
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- On the complexity of verifiable secret sharing and multiparty computation
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Non-complete set coverings for higher order threshold implementations
- Privacy-preserving distributed k-WTA algorithm based on state combination
- An equational approach to secure multi-party computation
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Full threshold change range of threshold changeable secret sharing
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Nearly optimal robust secret sharing
- Reverse firewalls for actively secure MPCs
- On secret sharing, randomness, and random-less reductions for secret sharing
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- Privacy-preserving data splitting: a combinatorial approach
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Four families of squares of BCH codes and their complements
- Constructions of LCD codes from their Schur products
- Properties of constacyclic codes under the Schur product
- Multiparty Computation from Somewhat Homomorphic Encryption
- High dimensional affine codes whose square has a designed minimum distance
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Card-Based Secure Sorting Protocol
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- Trojan-resilience without cryptography
- Multiparty computation, an introduction
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Secret Sharing Schemes with Algebraic Properties and Applications
- Privacy preserving distributed optimization using homomorphic encryption
This page was built for publication: Secure multiparty computation and secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500574)
