The Security Weakness of Block Cipher Piccolo against Fault Analysis by Junghwan Song, Kwanhyung Lee, Younghoon Jung

“…And our attack needs 2 20.86 and 2 21.60 encryptions with random 4-bit fault injections for Piccolo-80 and Piccolo-128, respectively.…”
Get full text

Scaling Analysis of the Tensile Strength of Bamboo Fibers Using Weibull Statistics by Jiaxing Shao, Fang Wang, Lu Li, Junqian Zhang

“…The proposed model considers the random nature of fiber strength, which is reflected by using a two-parameter Weibull distribution function. …”
Get full text

Identity-based puncturable signature scheme by Dongmei YANG, Yue CHEN, Jianghong WEI, Xuexian HU

“…To overcome the shortcomings of available forward-secure identity-based signature （IBS） scheme in terms of actual practicability and secret key update efficiency， the notion of identity-based puncturable signature （IBPS） scheme was proposed based on the idea of puncturable public-key encryption scheme.Specifically， the syntax and security notion of IBPS were given， and then a concrete IBPS scheme was constructed based on Bloom filter.Under the computational Diffie-Hellman assumption， the proposed scheme achieved the existential unforgeability in the random oracle model.The performance analysis and implementation results demonstrate that， compared with traditional forward-secure IBS schemes， the proposed scheme provides more practical fine-grained forward secrecy， and has higher efficiency of secret key update.…”
Get full text

Multiuser secret key generation based on received signal by Aolin CAI, Liang JIN, Zhou ZHONG, Yangming LOU

“…The secret key generation method based on channel characteristic provides a new way for communication security.But under the conditions of multiuser and slow fading,because of the slow channel parameter changing rate,using the secret key generation method above can result in a low secret key rate.To solve this problem,a multiuser secret key generation method based on the received signal was proposed.By distributing the random signals to different users using block diagonalization precoding,base station and user can extract the secret key from the received signal.The novel method could significantly increase the secret key rate of multiuser under the quasi-static channel and slow-fading channel,which is verified by simulations.…”
Get full text

Address overloading-based packet forwarding verification in SDN by Ping WU, Chaowen CHANG, Zhibin ZUO, Yingying MA

“…Aiming at the problem that the most existing forwarding verification mechanisms in software-defined network (SDN) verified packets hop-by-hop by incorporating new secure communication protocols, which incurred significant computation and communication overhead, an address overloading-based forwarding verification mechanism was proposed.The flow runtime was divided into consecutive random intervals by the ingress switch via overloading address fields of packet, basing on overloading address, packets were forwarded by each subsequent switch, and the controller sampled the packets forwarded by ingress and egress switch in the interval to detect abnormal behavior on the path.Finally, the proposed mechanism and simulation network was implemented and evaluated.Experiments show that the mechanism achieves efficient forwarding and effective anomaly detection with less than 8% of additional forwarding delays.…”
Get full text

Averaging Principles for Nonautonomous Two-Time-Scale Stochastic Reaction-Diffusion Equations with Jump by Yong Xu, Ruifang Wang

“…In this paper, we aim to develop the averaging principle for a slow-fast system of stochastic reaction-diffusion equations driven by Poisson random measures. The coefficients of the equation are assumed to be functions of time, and some of them are periodic or almost periodic. …”
Get full text

New construction of secure range query on encrypted data in cloud computing by Shao-hui WANG, Zhi-jie HAN, Dan-wei CHEN, Ru-chuan WANG

“…To solve the information leakage problem resulting from several assertions of previous range query solutions,there is a secure range query scheme with one assertion (SRQSAE scheme),and the scheme is claimed to be secure against ciphertext-only attack.The security analysis on SRQSAE scheme is presented,and it shows SRQSAE scheme can not hide the size of search keyword.A new scheme of secure range query on encrypted data is proposed through introducing random numbers in the generation of search index and trapdoor.The new scheme can provide the privacy guarantee on search range and search keyword,and it achieves high level needs of security without losing efficiency.…”
Get full text

Survey on differential privacy and its progress by Zhi-qiang GAO, Yu-tao WANG

“…With the arrival of the era of big data sharing,data privacy protection issues will be highlighted.Since its introduction in 2006,differential privacy technology has been widely researched in data mining and data publishing.In recent years,Google,Apple and other companies have introduced differential privacy technology into the latest products,and differential privacy technology has become the focus of academia and industry again.Firstly,the traditional centralized model of differential privacy was summarized,from the perspective of analysis of data mining and data released in the differential privacy way.Then the latest local differential privacy regarding data collection and data analysis based on the local model was described,involving crowdsourcing with random response technology,BloomFilter,statistical inference techniques.Finally,the main problems and solutions of differential privacy technology were summarized.…”
Get full text

Certificateless-based efficient aggregate signature scheme with universal designated verifier by Yu-lei ZHANG, Dong-rui ZHOU, Chen-yi LI, Yong-jie ZHANG, Cai-fen WANG

“…The security model of the certificateless aggregate signature scheme with universal designated verifier was studied,and then a certificateless aggregate signature scheme with universal designated verifier using bilinear pairings was proposed.In the random oracle mode,based on the hardness of the computational Diffie-Hellman problem,the new scheme was proved to be secure against three attacks of certificateless aggregate signature scheme with universal designated verifier.Meanwhile,the scheme satisfies properties of strong designated verify and non-transferability.Furthermore,the length of final aggregate signature is equivalent as the length of signal user’s signature,it is more efficient than others because the pairing computation is fixed among public verifies and designed verifies.…”
Get full text

Efficient signcryption scheme based on Cocks’ identity cryptosystem by Changgen PENG, Xiaoyu ZHANG, Hongfa DING, Shanhui YANG

“…Most of the existing identity-based signcryption schemes are based on bilinear or multilinear pairing operations construction.To solve the problem of low efficiency caused by complex pair operation, a new efficient signcryption scheme based on the identity cryptosystem of Cocks was proposed.Firstly, the security model of the proposed scheme was formalized, and the definition of confidentiality and unforgeability was given.Secondly, the quadratic residue problem was used to realize the concrete construction of the proposed scheme, and the signature algorithm was designed in a logical step by combining Jacobi symbol operation.Finally, the security proofed that the scheme satisfied the confidentiality and unforgeability was given under the random prediction model.The efficiency analysis shows that compared with the existing identity-based signcryption scheme, the proposed scheme greatly improves the computing efficiency and has good characteristics of identity-based cryptosystem.…”
Get full text

Vibration Control of Linear Split Stirling Cryogenic Cooler for Airborne Infrared Application by A.M. Veprik, V.I. Babitsky, N. Pundak, S.V. Riabzev

“…The traditional method of their passive isolation fails to meet the restraints on the static and dynamic deflections which are originated by the combined action of the airborne g-loading and harsh random vibration.…”
Get full text

ON APPLICATION OF ARTIFICIAL NEURAL NETWORKS FOR MODELING OF WATER CONSUMPTION by Alexander N. Salugin, Roman N. Balkushkin

“…As a rule, these parameters are random, and the mathematical models describing the water balance are stochastic. …”

Modeling Anomalous Diffusion by a Subordinated Integrated Brownian Motion by Long Shi, Aiguo Xiao

“…We consider a particular type of continuous time random walk where the jump lengths between subsequent waiting times are correlated. …”
Get full text

Evaluation and analysis of the computation cost of linear network coding by PU Bao-xing1, WANG Wei-ping2

“…The complexity of algebraic operation methods on Galois fields was analyzed and the operation mechanism of linear network coding was anatomized.Based on deterministic network coding data transmission and random network coding data transmission for single-source multicast connection,the mathematic model had been created to estimate the computation cost of linear network coding and the relationship between operation cost and environmental parameters had been revealed.The key factors of affecting the operation cost were also analyzed.The analysis results indicate that computation cost can be decreased through properly choosing environment parameters.Numerical calculation and simulation results demonstrate the correctness of the proposed model and validate the theoretical analysis.…”
Get full text

A method for synthetic speech detection using local phase quantization by Jia XU, Zhihua JIAN, Honghui JIN, Man YANG

“…Due to the convenience of speech synthesis, synthesized disguised speech poses a great threat to the security of speaker verification systems.In order to further enhance the ability of detecting the camouflage to the speaker verification system, a method of synthetic speech detection was put forward using the information in spectral domain of the synthetic speech spectrogram.The method employed the local phase quantization (LPQ) algorithm to describe frequency domain information in the speech spectrogram.Firstly, the spectrogram was divided into several sub-blocks, and then the LPQ was performed on each sub-block.After the histogram statistical analysis, the LPQ feature vector was obtained and used as the input feature of the random forest classifier to realize the synthetic speech detection.The experimental results demonstrate that the proposed method further reduces tandem detection cost function (t-DCF) and has better generalization ability.…”
Get full text

A Secure and Fair Joint E-Lottery Protocol by Chin-Ling Chen, Yuan-Hao Liao, Woei-Jiunn Tsaur

“…In this paper, we use the multisignature and verifiable random function to construct a secure and fair joint e-lottery scheme. …”
Get full text

Evaluation Model of Land Use Spatial Equilibrium Based on Regional Collaborative Remote Sensing Observation by Lu Huang

“…Moreover, this paper analyzes the existing land space assessment algorithms, identifies the shortcomings of the traditional algorithms, and improves the traditional methods by combining random forest classification and image texture features. …”
Get full text

Identity-based cloud storage integrity checking from lattices by Miaomiao TIAN, Chuang GAO, Jie CHEN

“…With the rapid development of cloud storage,more and more users are storing their data in the cloud.To verify whether the users’ data stored in the cloud is corrupted,one effective method is to adopt cloud storage integrity checking schemes.An identity-based cloud storage integrity checking scheme was proposed on the small integer solution problem over ideal lattices,and it was proven to be secure against the adaptive identity attacks of clouds in the random oracle model.To validate the efficiency of the scheme,extensive experiments were conducted to make performance-comparisons between the scheme and the existing two identity-based cloud storage integrity checking schemes.The experimental results show that the online tag-generation time and the proof-verification time of the scheme are respectively reduced by 88.32%～93.74% and 98.81%～99.73%.…”
Get full text

Analysis of network coding delay:a Markov state transfer approach by Yu-ben QU, Chen CHEN, Chao DONG, Hai WANG

“…Network coding has been validated as an effective means to improve network throughput and reliability,but the study of its delay performance is not enough.Agai the widely used random linear network coding,the proposed method,based on the Markov state transfer,analyzed the delay expectation and probability distribution of the unicast flow in a single hop scene,and presented the exact recursions.Then according to numerical simulation,the effect of the encoding parameters were analyzed such as the finite f eld size,the channel loss rate and the encoding batch size on the delay.The results show that,as the finite field q increases,the delay variance continues to become smaller; the average delay is almost linear with the channel loss rate and the encoding batch size individually.…”
Get full text

Coverage optimization algorithm based on VF-CS in mobile sensor network by Guanghui LI, Shihong HU

“…A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.…”
Get full text