Lattice-based treshold-changeability for standard CRT secret-sharing schemes
type: Item
instance of: scholarly article
title: Lattice-based treshold-changeability for standard CRT secret-sharing schemes
zbMATH Open document ID: 1156.94381
author: Ron Steinfeld
author: Josef Pieprzyk
author: Huaxiong Wang
published in: Finite Fields and their Applications
publication date: 2009-02-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94B75
zbMATH DE Number: 5503972
MaRDI profile type: Publication
full work available at URL: j.ffa.2005.04.007
OpenAlex ID: W2012277781
Wikidata QID: Q59485061
cites work: A modular approach to key safeguarding
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Generalized privacy amplification
cites work: Q4341737
cites work: Finding smooth integers in short intervals using CRT decoding
cites work: Q4379555
cites work: Chinese remaindering with errors
cites work: Geometric algorithms and combinatorial optimization.
cites work: Q3751649
cites work: Geometric and analytic number theory. Transl. from the German by Rudolf Taschner
cites work: Factoring polynomials with rational coefficients
cites work: Q3149760
cites work: Q4322858
cites work: Q4269754
cites work: Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures
cites work: How to Share a Secret
cites work: Q3043938
cites work: Approximate formulas for some functions of prime numbers
cites work: How to share a secret
cites work: Noisy Chinese remaindering in the Lee norm
cites work: Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
DOI: 10.1016/J.FFA.2005.04.007
description: scientific article; zbMATH DE number 5503972