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

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

Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang

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

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (10)

A collaborative secret sharing scheme based on the Chinese remainder theorem ⋮ Secret sharing with secure secret reconstruction ⋮ Full threshold change range of threshold changeable secret sharing ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ Ramp scheme based on CRT for polynomial ring over finite field ⋮ Threshold Changeable Ramp Secret Sharing ⋮ Secret image sharing scheme with threshold changeable capability ⋮ Threshold changeable secret sharing with secure secret reconstruction ⋮ Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice-based treshold-changeability for standard CRT secret-sharing schemes