|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Achieve Personalized Anonymity Through Query Blocks Exchanging显示文摘In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency. | Chunguang Ma Lei Zhang Songtao Yang Xiaodong Zheng Pinhui Ke | 2016 | China Communications2016，13，11： | 13 |
| 2 | On the Error Linear Complexity Spectrum of Binary Sequences with Period of Power of Two显示文摘The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second critical error linear complexity are provided respectively. | CHANG Zuling KE Pinhui | 2015 | Chinese Journal of Electronics2015，24，2： | 3 |
| 3 | On the Cross-Correlation Distribution of d-Ary Generalized Legendre-Sidelnikov Sequences显示文摘The cross-correlation distribution of constant multiple sequences of the d-ary generalized LegendreSidelnikov sequences is investigated via character sums. An upper on the cross-correlation values of the sequences is then presented. As a byproduct, the autocorrelation distribution of d-ary Sidelnikov sequence is completely determined, which is only known in a special case. | KE Pinhui YE Zhifan ZHANG Shengyuan CHANG Zuling | 2018 | Chinese Journal of Electronics2018，27，2： | 2 |
| 4 | On the linear Complexity and the Autocorrelation of Generalized Cyclotomic Binary Sequences with the Period 2p~ 显示文摘 | Ke Pinhui Zhang Jie Zhang Shengyuan | 2013 | Designs Codes and Cryptography2013，67，3： | 1 |
| 5 | New classes of quaternary cyclotomic sequence of length 2 p m with high linear complexity显示文摘 | Pinhui Ke Shengyuan Zhang | 2012 | Information Processing Letters2012，，16： | 1 |
| 6 | Linear Complexity of d-Ary Sequence Derived from Euler Quotients over GF(q)显示文摘For an odd prime p and positive integers r,d such that 0 | YE Zhifan KE Pinhui CHEN Zhixiong | 2019 | Chinese Journal of Electronics2019，28，3： | 1 |
| 7 | New Secondary Constructions of Generalized Bent Functions显示文摘Three new secondary constructions of generalized bent functions are presented.We provide a secondary construction of generalized bent functions from indirect sum methods proposed by Carlet et al.A new secondary construction of generalized bent functions from four initial functions is also investigated.We demonstrate that many known constructions can be derived from our proposed construction as special cases by choosing proper initial functions and parameters.By modifying the new construction,a novel secondary construction of generalized bent functions from two initial generalized bent functions is obtained.For the binary case,the dual functions of the bent functions by our method are presented,which share the same formula as the indirect sum. | YANG Zhiyao KE Pinhui CHEN Zhixiong | 2021 | Chinese Journal of Electronics2021，30，6： | 1 |
| 8 | Provably Secure Self-Certified Signature Schemes with Message Recovery显示文摘To solve the key escrow problem of the identity-based cryptosystem, Girault introduced the notion of a self-certified public key, which not only eliminates the need to authenticate a public key but also solves the key escrow problem. This paper proposes a Self-Certified Signature (SCS) scheme with message recovery and two variants without using bilinear pairings: one is the authenticated encryption scheme in which only the designated receiver can verify the signature, and the other is the authenticated encryption scheme with message linkage that deals with large messages. These three SCS schemes are provably secure in the random oracle model and are more efficient than previous schemes. | Zhang Shengyuan Tang Fei Lin Changlu Ke Pinhui | 2012 | China Communications2012，9，10： | 0 |
| 9 | New classes of sequence families with low correlation by using multiplicative and additive characters显示文摘为奇怪的主要 p,句号 p m 的一个新顺序家庭 1,尺寸(M 1 ) p mr 被建议用趋于增加并且添加剂人物。为顺序家庭的重要关联的最大的大小的上面的界限用著名特性和被导出。上面的界限被显示是 $(r + 1 )\sqrt { p ^ m }+ 3 $ ,它 asymptotically 遇见韦尔奇界限。 | Pinhui KE Shengyuan ZHANG | 2012 | Frontiers of Electrical and Electronic Engineering in China2012，7，3： | 0 |
| 10 | Ramp Scheme Based on CRT for Polynomial Ring over Finite Field显示文摘Chinese Reminder Theorem(CRT)for integers has been widely used to construct secret sharing schemes for different scenarios,but these schemes have lower information rates than that of Lagrange interpolation-based schemes.In ASIACRYPT 2018,Ning,et al.constructed a perfect(r,n)-threshold scheme based on CRT for polynomial ring over finite field,and the corresponding information rate is one which is the greatest case for a(r,n)-threshold scheme.However,for many practical purposes,the information rate of Ning,et al.scheme is low and perfect security is too much security.In this work,the authors generalize the Ning,et al.(r,n)-threshold scheme to a(t,r,n)-ramp scheme based on CRT for polynomial ring over finite field,which attains the greatest information rate(r−t)for a(t,r,n)-ramp scheme.Moreover,for any given 2≤r_(1) | DING Jian KE Pinhui LIN Changlu WANG Huaxiong | 2023 | Journal of Systems Science & Complexity2023，36，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员