Protocols for group oriented secret sharing

Tzonelih Hwang

doi:10.1016/0020-0190(92)90236-O

Protocols for group oriented secret sharing

Tzonelih Hwang

Department of Computer Science and Information Engineering

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

2 Citations (Scopus)

Abstract

A practical noninteractive scheme is proposed to simultaneously solve several open problems in group oriented cryptography. The sender of the information is allowed to determine the encryption/decryption keys as well as the information destination without any coordination with the receiving group. The encrypted message is broadcasted to the receiving group and the receivers may authenticate themselves for their legitimacy of the information directly from the ciphertext. The security of the scheme can be shown to be equivalent to the difficulty of solving the discrete logarithm problem.

Original language	English
Pages (from-to)	179-182
Number of pages	4
Journal	Information Processing Letters
Volume	42
Issue number	4
DOIs	https://doi.org/10.1016/0020-0190(92)90236-O
Publication status	Published - 1992 Jun 19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(92)90236-O

Fingerprint Dive into the research topics of 'Protocols for group oriented secret sharing'. Together they form a unique fingerprint.

Cite this

@article{18c9de941cac4d4f9d0841f60024ca16,

title = "Protocols for group oriented secret sharing",

abstract = "A practical noninteractive scheme is proposed to simultaneously solve several open problems in group oriented cryptography. The sender of the information is allowed to determine the encryption/decryption keys as well as the information destination without any coordination with the receiving group. The encrypted message is broadcasted to the receiving group and the receivers may authenticate themselves for their legitimacy of the information directly from the ciphertext. The security of the scheme can be shown to be equivalent to the difficulty of solving the discrete logarithm problem.",

author = "Tzonelih Hwang",

year = "1992",

month = jun,

day = "19",

doi = "10.1016/0020-0190(92)90236-O",

language = "English",

volume = "42",

pages = "179--182",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Protocols for group oriented secret sharing

AU - Hwang, Tzonelih

PY - 1992/6/19

Y1 - 1992/6/19

N2 - A practical noninteractive scheme is proposed to simultaneously solve several open problems in group oriented cryptography. The sender of the information is allowed to determine the encryption/decryption keys as well as the information destination without any coordination with the receiving group. The encrypted message is broadcasted to the receiving group and the receivers may authenticate themselves for their legitimacy of the information directly from the ciphertext. The security of the scheme can be shown to be equivalent to the difficulty of solving the discrete logarithm problem.

AB - A practical noninteractive scheme is proposed to simultaneously solve several open problems in group oriented cryptography. The sender of the information is allowed to determine the encryption/decryption keys as well as the information destination without any coordination with the receiving group. The encrypted message is broadcasted to the receiving group and the receivers may authenticate themselves for their legitimacy of the information directly from the ciphertext. The security of the scheme can be shown to be equivalent to the difficulty of solving the discrete logarithm problem.

UR - http://www.scopus.com/inward/record.url?scp=0026873812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026873812&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(92)90236-O

DO - 10.1016/0020-0190(92)90236-O

M3 - Article

AN - SCOPUS:0026873812

VL - 42

SP - 179

EP - 182

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -