An computation-efficient generalized group-oriented cryptosystem

MaRDI QIDQ3064573zbMATHFDO

Authors Ting-Yi Chang

Publication date 22 December 2010

zbMATH Keywords

provable securitythreshold cryptosystemaccess structuredecisional Diffie-Hellman problemgroup-oriented cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2061980
• scientific article; zbMATH DE number 697809
• All-in-one group-oriented cryptosystem based on bilinear pairing
• Threshold cryptosystem with multiple secret sharing policies
• scientific article; zbMATH DE number 1303971

Cited in

(7)

• Information Security and Cryptology - ICISC 2003
• Generic-Group Identity-Based Encryption: A Tight Impossibility Result
• scientific article; zbMATH DE number 2040842 (Why is no real title available?)
• All-in-one group-oriented cryptosystem based on bilinear pairing
• Protocols for group oriented secret sharing
• A group oriented cryptosystem for the vector space access structure
• scientific article; zbMATH DE number 2061980 (Why is no real title available?)

This page was built for publication: An computation-efficient generalized group-oriented cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064573)