Secure Computation from Random Error Correcting Codes
From MaRDI portal
Recommendations
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Nearly optimal robust secret sharing
- On the complexity of arithmetic secret sharing
Cited in
(50)- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Evolving ramp secret sharing with a small gap
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- Theory of supports for linear codes endowed with the sum-rank metric
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- The optimal linear secret sharing scheme for any given access structure
- A note on ramp secret sharing schemes from error-correcting codes
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Polynomial evaluation and side channel analysis
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Secret Sharing Schemes with Algebraic Properties and Applications
- Recent advances in non-perfect secret sharing schemes
- Towards secure two-party computation from the wire-tap channel
- Blakley type secret sharing scheme based on the intersection of subspaces
- Encryption and Error-Correction Coding Using D Sequences
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
- Geometric and Computational Approach to Classical and Quantum Secret Sharing
- A random encoding method for secure data communication: An extension of sequential coding
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy
- Secure Erasure Codes With Partial Reconstructibility
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
- Interactive function computation via polar coding
- Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
- On secret sharing with nonlinear product reconstruction
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- OT-Combiners via Secure Computation
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- On \(d\)-multiplicative secret sharing
- Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications
- How to recover a secret with O(n) additions
- Generalized fuzzy password-authenticated key exchange from error correcting codes
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Traceable secret sharing: strong security and efficient constructions
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Considerate ramp secret sharing
- Three-level secret sharing schemes from the twisted cubic
- Duals of multiplicity codes
- Context-dependent threshold decryption and its applications
- Cryptography with weak privacy
- Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
This page was built for publication: Secure Computation from Random Error Correcting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429397)
