Finite set theory and its application to cryptology

Cao Zhenfu

doi:10.1016/0378-3758(95)00076-3

Finite set theory and its application to cryptology

Cao Zhenfu^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A (k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.

Original language	English
Pages (from-to)	129-136
Number of pages	8
Journal	Journal of Statistical Planning and Inference
Volume	51
Issue number	2
DOIs	https://doi.org/10.1016/0378-3758(95)00076-3
State	Published - 1 May 1996
Externally published	Yes

Access to Document

10.1016/0378-3758(95)00076-3

Cite this

@article{cf51f1f5b1d04bc68e1efe50fbfe9875,

title = "Finite set theory and its application to cryptology",

abstract = "The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A (k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.",

author = "Cao Zhenfu",

year = "1996",

month = may,

day = "1",

doi = "10.1016/0378-3758(95)00076-3",

language = "英语",

volume = "51",

pages = "129--136",

journal = "Journal of Statistical Planning and Inference",

issn = "0378-3758",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Finite set theory and its application to cryptology

AU - Zhenfu, Cao

PY - 1996/5/1

Y1 - 1996/5/1

N2 - The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A (k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.

AB - The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A (k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.

UR - https://www.scopus.com/pages/publications/0030147095

U2 - 10.1016/0378-3758(95)00076-3

DO - 10.1016/0378-3758(95)00076-3

M3 - 文章

AN - SCOPUS:0030147095

SN - 0378-3758

VL - 51

SP - 129

EP - 136

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

IS - 2

ER -

Finite set theory and its application to cryptology

Abstract

Access to Document

Other files and links

Fingerprint

Cite this