Results

**1 - 2**of**2**### Programming R. Rivest Techniques Editor How to Share a Secret

"... In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k- 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic ..."

Abstract
- Add to MetaCart

(Show Context)
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k- 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfor-tunes destroy half the pieces and security breaches ex-pose all but one of the remaining pieces. Key Words and Phrases: cryptography, key manage-ment, interpolation

### AND

, 1983

"... Windowing a two-dimensional picture means to determine those line segments of the picture that are visible through an axis-parallel window. A study of some algorithmic problems involved in windowing a picture is offered. Some methods from computational geometry are exploited to store the picture in ..."

Abstract
- Add to MetaCart

(Show Context)
Windowing a two-dimensional picture means to determine those line segments of the picture that are visible through an axis-parallel window. A study of some algorithmic problems involved in windowing a picture is offered. Some methods from computational geometry are exploited to store the picture in a computer such that (1) those line segments inside or partially inside of a window can be determined efficiently, and (2) the set of those line segments can be maintained efficiently while the window is moved parallel to a coordinate axis and/or it is enlarged or reduced. e 1984 Academic press, IIK. 1.