Skip to main content

Consortium for Mathematics and its Applications

Product ID: 99730
Supplementary Print
Undergraduate

Sharing a Secret (UMAP)

Author: A.R Meijer


This module considers the problem of devising a scheme for predesignated subsets of a group of people to hold a secret jointly (each knowing just a part), without other subsets being able to discover the secret. The problem has applications to many areas where shared responsibility for security and decision-making is important, such a banking (the vault combination), commerce (trade secrets), and warfare (weapons launching). A proof of the Chinese Remainder Theorem along with a generalization of it are included in this module.

Table of Contents:

INTRODUCTION

THE CHINESE REMAINDER THEOREM

A MORE GENERAL FORM OF THE CRT

A THRESHOLD SCHEME

ASYMMETRICAL SHARING

INFORMATION

SOLUTIONS TO THE EXERCISES

REFERENCES

ABOUT THE AUTHOR

©1999 by COMAP, Inc.
UMAP Module
17 pages

Mathematics Topics:

Discrete & Finite Mathematics , Number Theory, Set Theory

Application Areas:

Computers & Technology , Cryptology

Prerequisites:

Numerical congruences, Euclidian algorithm

You must have a Full Membership to download this resource.

If you're already a member, login here.

Not yet a member?