Secure Computation from Random Error Correcting Codes

DOI10.1007/978-3-540-72540-4_17zbMATH Open1141.94346OpenAlexW2136563111MaRDI QIDQ5429397FDOQ5429397

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

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

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

Mathematics Subject Classification ID

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

Cited In (45)

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

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)