The following pages link to (Q3374918):
Displaying 50 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Secure multi-party computation protocol for sequencing problem (Q350932) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Coset bounds for algebraic geometric codes (Q623250) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
- High dimensional affine codes whose square has a designed minimum distance (Q782859) (← links)
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- Strong \((n, t, n)\) verifiable secret sharing scheme (Q991242) (← links)
- Linear multi-secret sharing schemes based on multi-party computation (Q998657) (← links)
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls (Q1633460) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- On the (in)efficiency of non-interactive secure multiparty computation (Q1650437) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Constructing ideal secret sharing schemes based on Chinese remainder theorem (Q1710679) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Processing secure, verifiable and efficient SQL over outsourced database (Q1991841) (← links)
- Secret sharing schemes based on graphical codes (Q2016393) (← links)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes (Q2055621) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system (Q2118860) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← 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)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems (Q2160700) (← links)
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881) (← links)
- A group identification protocol with leakage resilience of secret sharing scheme (Q2173730) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Secure publicly verifiable and proactive secret sharing schemes with general access structure (Q2291769) (← links)
- Squares of matrix-product codes (Q2302565) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
- Methods of encrypting monotonic access structures (Q2442940) (← links)
- A note on ramp secret sharing schemes from error-correcting codes (Q2450506) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
