维普中文期刊产品整合服务
14篇 您的检索式:作者名="FU Shaojing"
    题名 作者 年代 出处 被引量
1On the number of rotation symmetric Boolean functions显示文摘Rotation symmetric Boolean functions (RSBFs) have been used as components of different cryptosystems. This class of functions are invariant under circular translation of indices. In this paper, we investigated balanced RSBFs and 1st order correlation immune RSBFs. Based on constructive techniques, we give an accurate enumeration formula for n-variable balanced RSBFs when n is a power of a prime. Furthermore, an original and efficient method to enumerate all n-variable (n prime) 1st order correlationimmune functions is presented. The exact number of 1st order correlation immune RSBFs with 11 variables is 6925047156550478825225250374129764511077684773805520800 and the number of 13 variables has 189 digits. Then for more variables, we also provide a significant lower bound on the number of 1st order correlation immune RSBFs.FU ShaoJing LI Chao QU LongJiang 2010Science China(Information Sciences)2010,53,3:8
2Enable Data Dynamics for Algebraic Signatures Based Remote Data Possession Checking in the Cloud Storage显示文摘Cloud storage is one of the main application of the cloud computing.With the data services in the cloud,users is able to outsource their data to the cloud,access and share their outsourced data from the cloud server anywhere and anytime.However,this new paradigm of data outsourcing services also introduces new security challenges,among which is how to ensure the integrity of the outsourced data.Although the cloud storage providers commit a reliable and secure environment to users,the integrity of data can still be damaged owing to the carelessness of humans and failures of hardwares/softwares or the attacks from external adversaries.Therefore,it is of great importance for users to audit the integrity of their data outsourced to the cloud.In this paper,we first design an auditing framework for cloud storage and proposed an algebraic signature based remote data possession checking protocol,which allows a third-party to auditing the integrity of the outsourced data on behalf of the users and supports unlimited number of verifications.Then we extends our auditing protocol to support data dynamic operations,including data update,data insertion and data deletion.The analysis and experiment results demonstrate that our proposed schemes are secure and efficient.LUO Yuchuan FU Shaojing XU Ming WANG Dongsheng 2014China Communications2014,11,11:4
3Optically tunable fluorescent carbon nanoparticles and their application in fluorometric sensing of copper ions显示文摘A series of carb on nano particles(CNPs)with emissi on wavele ngth ranging from 483 to 525 nm were prepared by hydrothermal treatme nt of poly-3-thiopheneacetic acid(PTA)and NaOH.The emission wavelength and surface oxidation degree of CNPs were shown to be controllable by simply adjusti ng NaOH concentration.These CNPs prese nted obvious fluoresce nee spectral response toward copper ions(Cu^2+)through static quenching caused synergistically by electron transfer and inner filter effect.The O-and S-containing groups on the surface of CNPs were dem on strated to be resp on sible for their outsta nding sensing performa nee.Based on that,a CN Ps-based ratiometric fluoresce nt probe for Cu^2+with a high fluoresce nee quenching rate constant of 1.4×10^5 L/mol and a short resp onse time(10 s)was developed.Their practical applications in detecting Cu^2+in pond water and living cells were also dem on strated.Minhuan Lan Shaojing Zhao Shuilin Wu Xiaofang Wei Yanzhao Fu Juanjuan Wu Pengfei Wang Wenjun Zhang 2019Nano Research2019,12,10:2
4The Existence of a Class of Balanced Multi-output Rotation Symmetric Boolean Functions显示文摘A new characterization of balanced rotation symmetric(n, m)-functions is presented. Based on the characterization, the nonexistence of balanced rotation symmetric(p^r, m)-functions is determined, where p is an odd prime and m ≥ 2. And there exist balanced rotation symmetric(2~r, m)-functions for 2 ≤ m ≤ 2~r-r. With the help of these results, we also prove that there exist rotation symmetric resilient(2~r, m)-functions for 2 ≤ m ≤ 2~r-r-1.DU Jiao FU Shaojing QU Longjiang LI Chao PANG Shanqi 2018Chinese Journal of Electronics2018,27,5:2
5New constructions of q-variable 1-resilient rotation symmetric functions over F_p显示文摘Dear editor,Motivated by Refs.[1–10],we devote to constructing a class of q-variable 1-resilient rotation symmetric functions(RSFs)over the finite field F_p={0,1,...,p-1}in this letter.Throughout this letter,let p and q be different odd prime numbers.Jiao DU Shaojing FU Longjiang QU Chao LI Shanqi PANG 2016Science China(Information Sciences)2016,59,7:2
6Construction of even-variable rotation symmetric Boolean functions with maximum algebraic immunity显示文摘Rotation symmetric Boolean functions(RSBFs) have been used as components of different cryptosystems.In this paper,we investigate n-variable(n even and n≥12) RSBFs to achieve maximum algebraic immunity(AI),and provide a construction of RSBFs with maximum AI and nonlinearity.These functions have higher nonlinearity than the previously known nonlinearity of RSBFs with maximum AI.We also prove that our construction provides high algebraic degree in some case.FU ShaoJing LI Chao MATSUURA Kanta QU LongJiang 2013Science China(Information Sciences)2013,56,3:2
7Construction of highly nonliear resilient S-boxes with given degree显示文摘Fu Shaojing Matsuura K Li Chao 2012Designs Codes and Crytography2012,64,3:1
8Construction of Even-Variable Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity 显示文摘FU Shaojing LI Chao MATSUURA K 2009Lecture Notes in Computer Science2009,5888,:1
9Chen for Cloud Storage显示文摘FU Shaojing WANG Dongsheng XU Ming et aL Cryptanalysis of Remote Data Integrity Checking Protocol Proposed by L 2014IEICE TRANSACTIONS on Fun- damentals of Electronics Communications and Computer Sciences2014,97,1:1
10A lower dimension lattice attack on NTRU显示文摘Dear editor,Because of reasonably short length,easily created keys,high speed,low memory requirements and potential resistance to quantum attack,NTRU becomes one of the most popular public-key encryption systems and has drawn considerable attention.Motivated by[1–9],we devote to constructing a class of lower dimension lattices,called the IN-Lattice,and proposing a new lattice attack on NTRU cryptosystem.Zhichao YANG Shaojing FU Longjiang QU Chao LI 2018Science China(Information Sciences)2018,61,5:0
11Construction of Odd-Variable Boolean Function with Maximum Algebraic Immunity Using Univariate Polynomial Representation显示文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.Zhao Wentao Fu Shaojing Li Chao Qu Longjiang 2012China Communications2012,9,10:0
12A Scheduling Optimization Technique Based on Reuse in Spark to Defend Against APT Attack显示文摘Advanced Persistent Threat(APT) attack, an attack option in recent years, poses serious threats to the security of governments and enterprises data due to its advanced and persistent attacking characteristics. To address this issue, a security policy of big data analysis has been proposed based on the analysis of log data of servers and terminals in Spark. However, in practical applications, Spark cannot suitably analyze very huge amounts of log data. To address this problem, we propose a scheduling optimization technique based on the reuse of datasets to improve Spark performance. In this technique, we define and formulate the reuse degree of Directed Acyclic Graphs(DAGs) in Spark based on Resilient Distributed Datasets(RDDs). Then, we define a global optimization function to obtain the optimal DAG sequence, that is, the sequence with the least execution time. To implement the global optimization function, we further propose a novel cost optimization algorithm based on the traditional Genetic Algorithm(GA). Our experiments demonstrate that this scheduling optimization technique in Spark can greatly decrease the time overhead of analyzing log data for detecting APT attacks.Jianchao Tang Ming Xu Shaojing Fu Kai Huang 2018Tsinghua Science and Technology2018,23,5:0
13A better bound for implicit factorization problem with shared middle bits显示文摘This paper presents our investigation of the implicit factorization problem, where unknown prime factors of two RSA moduli share a certain number of middle bits. The problem is described as follows. Let N_1 = p_1q_1, N_2 =p_2q_2 be two different n-bit RSA moduli, where q_1, q_2 are both αn-bit prime integers.Suppose that p_1, p_2 share tn bits at positions from t_1 n to t_2 n =(t_1 + t)n. Then this problem focuses on the condition about t, α to factor N_1, N_2 efficiently. At PKC 2010, Faug`ere et al. showed that N_1, N_2 can be factored when t > 4α. Subsequently, in 2015, Peng et al. improved this bound to t > 4α-3α~2. In this paper,we directly apply Coppersmith's method to the implicit factorization problem with shared middle bits, and a better bound t > 4α-4α^(3/2) is obtained. The correctness of our approach is verified by experiments.Shixiong WANG Longjiang QU Chao LI Shaojing FU 2018Science China(Information Sciences)2018,61,3:0
14Practical privacy-preserving compressed sensing image recovery in the cloud显示文摘Imaging technology plays a significant role in various fields such as astronomy,monitoring,and medical treatment.The traditional Shannon/Nyquist sampling theorem specifies that one must sample at least two times faster than the signal bandwidth to avoid loss of information when capturing an image.This makes compression a necessity prior to storage or transmission[1]and mayKai HUANG Ming XU Shaojing FU Dongsheng WANG 2017Science China(Information Sciences)2017,60,9:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费