Visible to the public Biblio

Filters: Author is Huang, Huawei  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Huang, Huawei, Qu, Yunyun, Deng, Lunzhi.  2017.  Zero-Knowledge Identification Scheme Based on Symmetry Ergodic Matrices Exponentiation Problem. Proceedings of the 2017 International Conference on Cryptography, Security and Privacy. :71–75.

Symmetry ergodic matrices exponentiation (SEME) problem is to find x, given CxMDx, where C and D are the companion matrices of primitive polynomials and M is an invertible matrix over finite field. This paper proposes a new zero-knowledge identification scheme based on SEME problem. It is perfect zero-knowledge for honest verifiers. The scheme could provide a candidate cryptographic primitive in post quantum cryptography. Due to its simplicity and naturalness, low-memory, low-computation costs, the proposed scheme is suitable for using in computationally limited devices for identification such as smart cards.

Fang, Chao, Wang, Zhuwei, Huang, Huawei, Si, Pengbo, Yu, F. Richard.  2019.  A Stackelberg-Based Optimal Profit Split Scheme in Information-Centric Wireless Networks. 2019 IEEE International Conference on Communications Workshops (ICC Workshops). :1–6.
The explosive growth of mobile traffic in the Internet makes content delivery a challenging issue to cope with. To promote efficiency of content distribution and reduce network cost, Internet Service Providers (ISPs) and content providers (CPs) are motivated to cooperatively work. As a clean-slate solution, nowadays Information-Centric Networking architectures have been proposed and widely researched, where the thought of in-network caching, especially edge caching, can be applied to mobile wireless networks to fundamentally address this problem. Considered the profit split issue between ISPs and CPs and the influence of content popularity is largely ignored, in this paper, we propose a Stackelberg-based optimal network profit split scheme for content delivery in information-centric wireless networks. Simulation results show that the performance of our proposed model is comparable to its centralized solution and obviously superior to current ISP-CP cooperative schemes without considering cache deployment in the network.