Art

J-GLOBAL ID：201802257375969327   Reference number：18A1471145

A homomorphic encryption based on non-commutative algebra and its implementation

非可換代数を用いた準同型暗号の演算と実装

Author (2)： KIHARA Maki (Tokyo Univ. Sci., Chiba) ,  IRIYAMA Satoshi (Tokyo Univ. Sci., Chiba)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 118  Issue： 139(IT2018 12-26)  Page： 11-13  Publication year： Jul. 12, 2018 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *cryptogram ,  *algebra ,  *secret key cryptosystem ,  operation (mathematics)
Semi thesaurus term： *準同型暗号 ,  algebra ,  *非可換代数 ,  *common key cryptosystem ,  準同型演算

JST classification (1)： Code theory  (ND02030R)

Reference (13)：

• Paillier, Pascal. “Public-key cryptosystems based on composite degree residuosity classes.” International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 1999.
• Rivest, Ronald L., Adi Shamir, and Leonard Adleman. “A method for obtaining digital signatures and public-key cryptosystems.” Communications of the ACM 21.2 (1978): 120-126.
• Gentry, C. “Fully homomorphic encryption using ideal lattices. Annual ACM Symposium on Theory of Computing. Proceedings of the 41st annual ACM symposium on Theory of computing.” (2009).
• Gentry, Craig, and Shai Halevi. “Implementing gentry's fully-homomorphic encryption scheme.” Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, 2011.
• Goldwasser, Shafi, Silvio Micali, and Charles Rackoff. “The knowledge complexity of interactive proof systems.” SIAM Journal on computing 18.1 (1989): 186-208.

Terms in the title (3)： 可換代数 ,  暗号 ,  実装