Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An computation-efficient generalized group-oriented cryptosystem

From MaRDI portal
Publication:3064573
Jump to:navigation, search

zbMATH Open1215.94037MaRDI QIDQ3064573FDOQ3064573


Authors: Ting-Yi Chang Edit this on Wikidata


Publication date: 22 December 2010





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


zbMATH Keywords

provable securitythreshold cryptosystemaccess structuredecisional Diffie-Hellman problemgroup-oriented cryptosystem


Mathematics Subject Classification ID

Cryptography (94A60)



Cited In (7)

  • Title not available (Why is that?)
  • A group oriented cryptosystem for the vector space access structure
  • Title not available (Why is that?)
  • Generic-Group Identity-Based Encryption: A Tight Impossibility Result
  • Information Security and Cryptology - ICISC 2003
  • All-in-one group-oriented cryptosystem based on bilinear pairing
  • Protocols for group oriented secret sharing





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3064573&oldid=16123062"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:47. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki