A Public Key Cryptosystem Based On A Subgroup Membership Problem
We present a novel public key encryption scheme semantically secure in the standard model under the intractability assumption of a subgroup membership problem related to the factorization problem.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||For more information, please refer to the journal’s website (see hypertext link) or contact the author.|
|Keywords:||public key cryptosystem, subgroup membership problem, provable security|
|Divisions:||Past > Schools > Computer Science|
Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Institutes > Information Security Institute
|Copyright Owner:||Copyright 2005 Springer|
|Copyright Statement:||The original publication is available at SpringerLink http://www.springerlink.com|
|Deposited On:||13 Nov 2007|
|Last Modified:||29 Feb 2012 23:13|
Repository Staff Only: item control page