| Title | Degree-sequence Homomorphisms For Homomorphic Encryption Of Information |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Yao, Bing, Xie, Jianmin, Wang, Hongyu, Su, Jing |
| Conference Name | 2021 IEEE 5th Information Technology,Networking,Electronic and Automation Control Conference (ITNEC) |
| Keywords | Asymmetric Encryption, asymmetric encryption algorithm, Automation, compositionality, Conferences, Controllability, encoding, graph homomorphism, homomorphic encryption, Human Behavior, Lattices, Metrics, pubcrawl, Public key, public-key encryption, Resiliency, topological coding |
| Abstract | The cipher-text homomorphism encryption algorithm (homomorphic encryption) are used for the cloud safe and to solve the integrity, availability and controllability of information. For homomorphic encryption, we, by Topsnut-gpw technique, design: degree-sequence homomorphisms and their inverses, degree-sequence homomorphic chain, graph-set homomorphism, colored degree-sequence matrices and every-zero Cds-matrix groups, degree-coinciding degree-sequence lattice, degree-joining degree-sequence lattice, as well as degree-sequence lattice homomorphism, since number-based strings made by Topsnut-gpws of topological coding are irreversible, and Topsnut-gpws can realize: one public-key corresponds two or more privatekeys, and more public-key correspond one or more private-keys for asymmetric encryption algorithm. |
| DOI | 10.1109/ITNEC52019.2021.9587153 |
| Citation Key | yao_degree-sequence_2021 |
Degree-sequence Homomorphisms For Homomorphic Encryption Of Information