TY - GEN
T1 - Application of NTRU using group rings to partial decryption technique
AU - Yasuda, Takanori
AU - Anada, Hiroaki
AU - Sakurai, Kouichi
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - Partial decryption enables a ciphertext to be decrypted partially according to provided secret keys. In this paper, we propose a public key encryption scheme with the functionality of partial decryption. Our strategy is to use the NTRU cryptosystem. Under a design principle of the mathematical structure “group ring”, we extend the original NTRU into group ring NTRU (GR-NTRU). First, we propose a generic framework of our GR-NTRU. Our GR-NTRU allows partial decryption with a single encryption process using a single public key. Besides, when we execute partial decryption under a secret key of GR-NTRU, we need no information to identify each part in a whole ciphertext. Consequently, management of a public key and a corresponding set of secret keys is rather easier than the naive method. Next, we propose a concrete instantiation of our generic GR-NTRU. A multivariate polynomial ring NTRU scheme is obtained by employing a product of different cyclic groups as the basis of the group ring structure.We will show examples of those new variants of NTRU schemes with concrete parameter values, and explain how we can employ them to use the functionality of partial decryption.
AB - Partial decryption enables a ciphertext to be decrypted partially according to provided secret keys. In this paper, we propose a public key encryption scheme with the functionality of partial decryption. Our strategy is to use the NTRU cryptosystem. Under a design principle of the mathematical structure “group ring”, we extend the original NTRU into group ring NTRU (GR-NTRU). First, we propose a generic framework of our GR-NTRU. Our GR-NTRU allows partial decryption with a single encryption process using a single public key. Besides, when we execute partial decryption under a secret key of GR-NTRU, we need no information to identify each part in a whole ciphertext. Consequently, management of a public key and a corresponding set of secret keys is rather easier than the naive method. Next, we propose a concrete instantiation of our generic GR-NTRU. A multivariate polynomial ring NTRU scheme is obtained by employing a product of different cyclic groups as the basis of the group ring structure.We will show examples of those new variants of NTRU schemes with concrete parameter values, and explain how we can employ them to use the functionality of partial decryption.
UR - http://www.scopus.com/inward/record.url?scp=84962299524&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84962299524&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-31550-8_13
DO - 10.1007/978-3-319-31550-8_13
M3 - Conference contribution
AN - SCOPUS:84962299524
SN - 9783319315492
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 203
EP - 213
BT - Trusted Systems - 7th International Conference, INTRUST 2015, Revised Selected Papers
A2 - Yung, Moti
A2 - Zhang, Jianbiao
A2 - Yang, Zhen
PB - Springer Verlag
T2 - 7th International Conference on the Theory, Technologies and Applications of Trusted Systems, INTRUST 2015
Y2 - 7 December 2015 through 8 December 2015
ER -