Lattice-based treshold-changeability for standard CRT secret-sharing schemes

DOI10.1016/j.ffa.2005.04.007zbMath1156.94381WikidataQ59485061 ScholiaQ59485061MaRDI QIDQ998654

Huaxiong Wang, Ron Steinfeld, Josef Pieprzyk

Publication date: 9 February 2009

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2005.04.007

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory

Related Items

Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Geometric and analytic number theory. Transl. from the German by Rudolf Taschner
• Geometric algorithms and combinatorial optimization.
• Noisy Chinese remaindering in the Lee norm
• Approximate formulas for some functions of prime numbers
• How to share a secret
• Chinese remaindering with errors
• Generalized privacy amplification
• Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures
• How to Share a Secret
• A modular approach to key safeguarding
• Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
• Finding smooth integers in short intervals using CRT decoding