Secure Computation from Random Error Correcting Codes

DOI10.1007/978-3-540-72540-4_17zbMath1141.94346OpenAlexW2136563111MaRDI QIDQ5429397

Robbert de Haan, Shafi Goldwasser, Hao Chen, Vinod Vaikuntanathan, Ronald Cramer

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_17

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (34)

Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ 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 ⋮ Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ On \(d\)-multiplicative secret sharing ⋮ Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes ⋮ A simple combinatorial treatment of constructions and threshold gaps of ramp schemes ⋮ Secret sharing schemes with strong multiplication and a large number of players from toric varieties ⋮ Classical access structures of ramp secret sharing based on quantum stabilizer codes ⋮ Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications ⋮ How to recover a secret with \(O(n)\) additions ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Geometric and Computational Approach to Classical and Quantum Secret Sharing ⋮ The optimal linear secret sharing scheme for any given access structure ⋮ A note on ramp secret sharing schemes from error-correcting codes ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ Interactive function computation via polar coding ⋮ Three-level secret sharing schemes from the twisted cubic ⋮ On the Construction of (n, k)-schemes of Visual Cryptography Using a Class of Linear Hash Functions Over a Binary Field ⋮ OT-Combiners via Secure Computation ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves ⋮ Isolated Proofs of Knowledge and Isolated Zero Knowledge ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes ⋮ Evolving ramp secret sharing with a small gap ⋮ 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 ⋮ On Secret Sharing with Nonlinear Product Reconstruction

This page was built for publication: Secure Computation from Random Error Correcting Codes