Title
Primitive Power Roots Of Unity And Its Application To Encryption
Abstract
We first consider a variant of the Schmidt-Samoa-Takagi encryption scheme without losing additively homomorphic properties. We show that this variant is secure in the sense of IND-CPA under the decisional composite residuosity assumption, and of OW-CPA under the assumption on the hardness of factoring n = p(2)q. Second, we introduce new algebraic properties "affine" and "pre-image restriction," which are closely related to homomorphicity. Intuitively, "affine" is a tuple of functions which have a special homomorphic property, and "pre-image restriction" is a function which can restrict the receiver to having information on the encrypted message. Then, we propose an encryption scheme with primitive power roots of unity in (Z/n(s+1))(X). We show that our scheme has, in addition to the additively homomorphic property, the above algebraic properties. In addition to the properties, we also show that the encryption scheme is secure in the sense of OW-CPA and IND-CPA under new number theoretic assumptions.
Year
DOI
Venue
2009
10.1587/transfun.E92.A.1836
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
Paillier's encryption scheme, factoring, homomorphism, power roots of unity
Affine transformation,Homomorphic encryption,Discrete mathematics,Tuple,Root of unity,Encryption,Homomorphism,Probabilistic encryption,Factoring,Mathematics
Journal
Volume
Issue
ISSN
E92A
8
0916-8508
Citations 
PageRank 
References 
0
0.34
4
Authors
3
Name
Order
Citations
PageRank
Takato Hirano1113.87
Koichiro Wada261.12
Keisuke Tanaka327819.04