Pages that link to "Item:Q5500574"
From MaRDI portal
The following pages link to Secure Multiparty Computation and Secret Sharing (Q5500574):
Displayed 44 items.
- High dimensional affine codes whose square has a designed minimum distance (Q782859) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Privacy preserving distributed optimization using homomorphic encryption (Q1716476) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- A note on secure multiparty computation via higher residue symbols (Q2040551) (← links)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes (Q2055621) (← links)
- Secure multi-party quantum computation with a dishonest majority (Q2055679) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Complexity and performance of secure floating-point polynomial evaluation protocols (Q2148764) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation (Q2179390) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets (Q2200519) (← links)
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers (Q2200560) (← links)
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Squares of matrix-product codes (Q2302565) (← links)
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption (Q2697678) (← links)
- Trojan-resilience without cryptography (Q2697869) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- Secret Sharing Schemes with Algebraic Properties and Applications (Q3188241) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
- The quadratic hull of a code and the geometric view on multiplication algorithms (Q5043439) (← links)
- (Q5090431) (← links)
- (Q5140836) (← links)
- ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM (Q5151274) (← links)
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties (Q5346825) (← links)
- Complete characterization of broadcast and pseudo-signatures from correlations (Q6061375) (← links)
- Full threshold change range of threshold changeable secret sharing (Q6101272) (← links)
- On secret sharing, randomness, and random-less reductions for secret sharing (Q6114236) (← links)
- Improved single-round secure multiplication using regenerating codes (Q6157517) (← links)
- Perfect MPC over layered graphs (Q6186597) (← links)
- Some new classes of additive MDS and almost MDS codes over finite fields (Q6191099) (← links)