A novel one-time-programmable memory unit based on Schottky-type p-GaN diode

In this work,a novel one-time-programmable memory unit based on a Schottky-type p-GaN diode is proposed.During the programming process,the junction switches from a high-resistance state to a low-resistance state through Schottky junction breakdown,and the state is permanently preserved.The memory unit features a current ratio of more than 10^(3),a read voltage window of 6 V,a programming time of less than 10^(−4)s,a stability of more than 108 read cycles,and a lifetime of far more than 10 years.Besides,the fabrication of the device is fully compatible with commercial Si-based GaN process platforms,which is of great significance for the realization of low-cost read-only memory in all-GaN integration.

One-time fertilization at first flowering improves lint yield and dry matter partitioning in late planted short-season cotton

Cotton producers have substantially reduced their inputs(labor,nutrients,and management)mainly by adopting a shortseason cropping management that is characterized by late sowing,high density,and reduced fertilization with one-time application at the first bloom stage without lint yield reduction.However,it has been hypothesized that one-time fertilization at an earlier growth stage could be a more effective and economic management practice.A two-year field experiment was conducted by applying five fertilizer one-time fertilization at 0(FT1),5(FT2),10(FT3),15(FT4),and 20(FT5)days after the first flower appeared in the field and one three-split fertilizer application taken as the conventional control(FT6),making six treatments altogether.Cotton growth period,biomass accumulation,yield,and its formation were quantified.The results showed that the one-time fertilization did not affect the cotton growth progress as compared to FT6,however,the total crop cycles for FT3–FT5 were 3 days shorter.FT1 produced the highest cotton lint yield(1396 kg ha–1),which was similar to the FT6 but higher than the other treatments,and could be attributed to more bolls per unit area and higher lint percentage.Cotton yield was positively correlated with cotton plant biomass accumulated.FT1 had both the highest average(VT)(193.7 kg ha–1 d–1)and the highest maximum(VM)(220.9 kg ha–1 d–1)rates during the fast biomass accumulation period.These results suggest that one-time fertilizer application at the first flower stage might be an adjustment that is more effective than at first bloom,and allowed for easier decision making for application date due to non counting of plants with flowers is needed.

One-time sintering process to modify xLi2MnO3(1-x)LiMO2 hollow architecture and studying their enhanced electrochemical performances

To solve the critical problems of lithium rich cathode materials, e.g., structure instability and short cycle life, we have successfully prepared a ZrO2-coated and Zr-doping xLi2MnO3·(1–x)LiMO2 hollow architecture via one-time sintering process. The modified structural materials as lithium-ion cathodes present good structural stability and superior cycle performance in LIBs. The discharge capacity of the ZrO2-coated and Zr-doped hollow pristine is 220 mAh g-1 at the 20th cycle at 0.2 C(discharge capacity loss, 2.7%)and 150 m Ah g-1 at the 100 th cycle at 1 C(discharge capacity loss, 17.7%), respectively. However, hollow pristine electrode only delivers 203 m Ah g-1 at the 20 th cycle at 0.2 C and 124 mAh g-1 at the 100 th cycle at 1 C, respectively, and the corresponding to capacity retention is 92.2% and 72.8%, respectively.Diffusion coefficients of modified hollow pristine electrode are much higher than that of hollow pristine electrode after 100 cycles(approach to 1.4 times). In addition, we simulate the adsorption reaction of HF on the surface of ZrO2-coated layer by the first-principles theory. The calculations prove that the adsorption energy of HF on the surface of ZrO2-coated layer is about-1.699 e V, and the ZrO2-coated layer could protect the hollow spherical xLi2MnO3·(1–x)LiMO2 from erosion by HF. Our results would be applicable for systematic amelioration of high-performance lithium rich material for anode with the respect of practical application.

Cryptanalysis of the One-Time Proxy Signature Scheme Used in Mobile Agents

We ayptanalyze Kim et. al's one-time proxy signature scheme used in mobileagents, and then a successful forgery is introduced It is showed that a dishonest customer cansuccessfully forge a valid one-time proxy signature by impersonating the stiver Furthermore, he canrequest the server with responsibility for the forged bidding information.

Effect of Nucleating Agent on the Crystallization of Tailings Glass Ceramics Prepared by One-time Sintering

Glass ceramics was made by the one-time sintering method using the main raw material of iron tailings. On the basis of quaternary system of CaO-MgO-Al2O3-SiO2, using DTA, XRD and SEM, the effects of different nucleating agents and mixing amounts as well as heat treatment on the crystallization of railings glass ceramics were studied. The experimental results show that, nucleating agent and heat treatment are two necessary conditions for one-time sintering preparation of tailings glass ceramics namely, only adding nucleating agent or experiencing heat treatment, the quaternary system can not crystallize. The composite nucleating agent consisting of Cr2O3 and TiO2 can further lead to the crystallization of the CaO-MgO-A1203-SiO2 quaternary system at the lower temperature, with the major phase of diopside. In the range of mass content, 0%-4%, crystal intensity and crystal content grow. But when mass content is more than 4%, the crystal size will become coarser and the crystal distribution will be less regular. Different heat treatment regimes do not change the composition of the crystalline major phase in the glass ceramics crystallization of CaO-MgO-Al2O3-SiO2 system. In the range of 30-60 minutes, with the extension of nucleation and crystallization, crystallization degree enhanced, but if the holding time surpasses 60 minutes, the crystallization is worse.

A One-Time Pad Encryption Scheme Based on Efficient Physical-Layer Secret Key Generation for Intelligent IoT System

The one-time pad(OTP)is an applicationlayer encryption technique to achieve the informationtheoretic security,and the physical-layer secret key generation(SKG)technique is a promising candidate to provide the random keys for OTP.In this paper,we propose a joint SKG and OTP encryption scheme with the aid of a reconfigurable intelligent surface(RIS)to boost secret key rate.To maximize the efficiency of secure communication,we divide the process of secure transmission into two stages:SKG and then encrypted packet transmission.Meanwhile,we design an optimal algorithm for allocating time slots for SKG to maximize SKG efficiency without security risk.Furthermore,we design a key updating protocol based on our SKG scheme for OTP encryption.Simulation results verify that our scheme can generate keys securely and efficiently,and significantly improve the secure communication performance in an intelligent IoT system.

One-Time Rational Secret Sharing Scheme Based on Bayesian Game

The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties, we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once. Moreover, we prove that the strategy is a perfect Bayesian equilibrium, adopted only by the parties in their decision-making according to their belief system （denoted by the probability distribution） and Bayes rule, without requiring simultaneous channels.

旅游景区环境保护博弈分析(英文)

Game model of environmental protection at scenic spots is established in this paper in order to carry out analysis of the equilibrium between one-time game and infinitely repeated game, disclose the reasons why the environment of scenic spots are destroyed, and propose the countermeasures to ensure the equilibrium of the game. The study also reveals that during the one-time game between tourists and tour operators, it is tour operators' dominant strategy not to control environmental pollution that leads to the destruction of environment at scenic spots. While, during the infinitely repeated game between tourists and tour operators, the realization of Pareto optimality equilibrium (The strategy of tourist is traveling, and the strategy of tour operators are controlling environmental pollution) is dependent upon the choice of players (tourists or operators) of triggering strategy (traveling or controlling environmental pollution). The supervision of the government upon operators can force them to control environmental pollution, which can consequently improve the efficiency of equilibrium in the game, and promote environmental protection at tourism scenic spots and sustainable development of tourism.

SAC-TA: A Secure Area Based Clustering for Data Aggregation Using Traffic Analysis in WSN

Clustering is the most significant task characterized in Wireless Sensor Networks (WSN) by data aggregation through each Cluster Head (CH). This leads to the reduction in the traffic cost. Due to the deployment of the WSN in the remote and hostile environments for the transmission of the sensitive information, the sensor nodes are more prone to the false data injection attacks. To overcome these existing issues and enhance the network security, this paper proposes a Secure Area based Clustering approach for data aggregation using Traffic Analysis (SAC-TA) in WSN. Here, the sensor network is clustered into small clusters, such that each cluster has a CH to manage and gather the information from the normal sensor nodes. The CH is selected based on the predefined time slot, cluster center, and highest residual energy. The gathered data are validated based on the traffic analysis and One-time Key Generation procedures to identify the malicious nodes on the route. It helps to provide a secure data gathering process with improved energy efficiency. The performance of the proposed approach is compared with the existing Secure Data Aggregation Technique (SDAT). The proposed SAC-TA yields lower average energy consumption rate, lower end-to-end delay, higher average residual energy, higher data aggregation accuracy and false data detection rate than the existing technique.

一次性密码验证系统

简单介绍一次性密码系统机理,并与现有密码机制进行比较。一次性密码体现出诸多优势,其算法设计灵活、复杂度适中、计算量较小且安全性较高,这里给出了应用该算法设计的登陆系统的实现和工作原理。实践应用证明,该算法的登陆系统应用灵活性强,系统资源消耗小,这均表明该算法的高性能及高可用性。

Structural vibration passive control and economic analysis of a high-rise building in Beijing

Performance analysis of the Pangu Plaza under earthquake and wind loads is described in this paper. The plaza is a 39-story steel high-rise building, 191 m high, located in Beijing close to the 2008 Olympic main stadium. It has both fluid viscous dampers （FVDs） and buckling restrained braces or unbonded brace （BRB or UBB） installed. A repeated iteration procedure in its design and analysis was adopted for optimization. Results from the seismic response analysis in the horizontal and vertical directions show that the FVDs are highly effective in reducing the response of both the main structure and the secondary system. A comparative analysis of structural seismic performance and economic impact was conducted using traditional methods, i.e., increased size of steel columns and beams and/or use of an increased number of seismic braces versus using FVD. Both the structural response and economic analysis show that using FVD to absorb seismic energy not only satisfies the Chinese seismic design code for a ＂rare＂ earthquake, but is also the most economical way to improve seismic performance both for one-time direct investment and long term maintenance.

Merkle Tree Digital Signature and Trusted Computing Platform

Lack of efficiency in the initial key generation process is a serious shortcoming of Merkle tree signature scheme with a large number of possible signatures. Based on two kinds of Merkle trees, a new tree type signature scheme is constructed, and it is provably existentially unforgeable under adaptive chosen message attack. By decentralizing the initial key generation process of the original scheme within the signature process, a large Merkle tree with 6.87×10^10 possible signatures can be initialized in 590 milliseconds. Storing some small Merkle trees in hard disk and memory can speed up Merkle tree signature scheme. Mekle tree signature schemes are fit for trusted computing platform in most scenarios.

Analysis and Application of Endogenous Wireless Security Principle for Key Generation

The open and broadcast nature of wireless channels leads to the inherent security problem of information leakage in wireless communication.We can utilize endogenous security functions to resolve this problem.The fundamental solution is channel-based mechanisms,like physical layer secret keys.Unfortunately,current investigations have not fully exploited the randomness of wireless channels,making secret key rates not high.Consequently,user data can be encrypted by reducing the data rate to match the secret key rate.Based on the analysis of the endogenous wireless security principle,we proposed that the channel-based endogenous secret key rate can nearly match the maximum data rate in the fast-fading environments.After that,we validated the proposition in an instantiation system with multiple phase shift keying(MPSK)inputs from the perspectives of both theoretical analysis and simulation experiments.The results indicate that it is possible to accomplish the onetime pad without decreasing the data rate via channelbased endogenous keys.Besides,we can realize highspeed endogenously secure transmission by introducing independent channels in the domains of frequency,space,or time.The conclusions derived provide a new idea for wireless security and promote the application of the endogenous security theory.

Effect of Heat Treatment Method on Microstructure of Tailings Glass Ceramics

A Cao-Mgo-Al2O3-SiO2 quaternary system was established with the main crystal phase design based on Diopside, and the effect of once-through sintering heat treatment on microstructure of iron railings glass ceramics was studied by using DTA, SEM along with measurement of microhardness and volume density. The experimental results show that, when the total amount of FeO and Fe2O3 exceeds 10wt%, a large number of fine nuclei are produced in the annealing process, and the phenomenon of nucleus resorption happens during the process of nucleation heat treatment, which is unfavorable for preparing iron tailings glass ceramics through once-through sintering method. When the annealing temperature from 1250 ℃ to 830 ℃, setting crystallization time for 4h, without heat treatment, crystals are well grown with arrangement and interlocking in glass phase. At 830 ℃ the crystals are well developed, well distributed and of good size; with crystallization time of 4 h the crystals with radial shape have high content and regular arrangement.

OTP-Based Software-Defined Cloud Architecture for Secure Dynamic Routing

In the current era,anyone can freely access the Internet thanks to the development of information and communication technology.The cloud is attracting attention due to its ability to meet continuous user demands for resources.Additionally,Cloud is effective for systems with large data flow such as the Internet of Things(IoT)systems and Smart Cities.Nonetheless,the use of traditional networking technology in the cloud causes network traffic overload and network security problems.Therefore,the cloud requires efficient networking technology to solve the existing challenges.In this paper,we propose one-time password-based software-defined cloud architecture for secure dynamic routing to mitigating the above-mention issues.The proposed cloud architecture provides a secure data path through dynamic routing using One-Time Internet Protocol(OTIP)algorithm between each layer.On the network side,we use software-defined technology to provide efficient network management and data security.We introduce a software-defined cloud architecture that applies OTIP algorithms for secure dynamic routing.We conduct a comparative analysis between general IP communication and proposed OTIP communication architecture.It evaluates the performance of OTIP algorithms.Finally,we examine the proposed software-defined cloud architecture,including how to apply OTIP in secure dynamic routing according to the results of the comparative analysis.

AN EFFICIENT BIT COMMITMENT SCHEME BASED ON FACTORING ASSUMPTION

Recently, many bit commitment schemes have been presented. This paper presents a new practical bit commitment scheme based on Schnorr's one-time knowledge proof scheme,where the use of cut-and-choose method and many random exam candidates in the protocols are replaced by a single challenge number. Therefore the proposed bit commitment scheme is more efficient and practical than the previous schemes In addition, the security of the proposed scheme under factoring assumption is proved, thus the cryptographic basis of the proposed scheme is clarified.

从完美保密到完美安全:基于密码学的内生安全分析

In this paper,we propose a conjecture that endogenous security without any prior knowledge is similar to perfect secrecy without any prior knowledge.To prove the conjecture,we first establish a cryptography model of instinct function security to transform the security problem in the network domain into an encryption problem in the cryptographic domain.Then,we inherit and apply the established ideas and means of Perfect Secrecy,and propose the concept,definition and corollaries of the perfect instinct function security(PIFS)corresponding to Perfect Secrecy.Furthermore,we take the DHR system as a concrete implementation of PIFS and propose the DHR Perfect Security Theorem corresponding to Shannon’s Perfect Secrecy Theorem.Finally,we prove that the DHR satisfying the“OneTime Reconstruction”constraint is the sufficient and necessary condition to achieve perfect security.This means that the existence of PIFS is also proven.The analysis shows that any reconfigurable system can be encrypted by its construct and that the PIFS converts the oneway transparent superiority of the attacker into a double-blind problem for both the attacker and the defender,which leads to that the attacker is impossible to obtain useful construction information from the attacks and unable to find a better way than blind trial-and-error or brute-force attacks.Since the attackers are required to have the new powerful ability to crack the structure cryptogram,the threshold of cyber security is raised to at least the same level as cryptogram deciphering,thereafter the ubiquitous cyber threats are destined to be significantly reduced.

New Constructions of Dynamic Threshold Cryptosystem

This study deals with the dynamic property of threshold cryptosystem. A dynamic threshold cryptosystem allows the sender to choose the authorized decryption group and the threshold value for each message dynamically. We first introduce an identity based dynamic threshold cryptosystem, and then use the CanettiHalevi-Katz(CHK) transformation to transform it into a fully secure system in the traditional public key setting.Finally, the elegant dual system encryption technique is applied to constructing a fully secure dynamic threshold cryptosystem with adaptive security.

Parameter Estimation Based on Set-valued Signals:Theory and Application

This paper summarizes the parameter estimation of systems with set-valued signals, which can be classified to three catalogs: one-time completed algorithms, iterative methods and recursive algorithms. For one-time completed algorithms, empirical measure method is one of the earliest methods to estimate parameters by using set-valued signals, which has been applied to the adaptive tracking of periodic target signals. The iterative methods seek numerical solutions of the maximum likelihood estimation, which have been applied to both complex diseases diagnosis and radar target recognition. The recursive algorithms are constructed via stochastic approximation and stochastic gradient methods, which have been applied to adaptive tracking of non-periodic signals.

Generic Transformation from Weakly to Strongly Unforgeable Signatures

Current techniques for transforming unforgeable signature schemes （the forged message has never been signed） to strongly unforgeable ones （the forged message could have been signed） require supplementary components to be added onto the original key pairs of the schemes. In addition, some of them can only be applied to a certain type of signature schemes. In this paper, we propose a new generic transformation technique which converts any unforgeable signature scheme into a strongly unforgeable one without modifying any component in the original key pair. This makes our technique especially compatible for practical use. Our technique is based on strong one-time signature schemes. We show that they can be constructed efficiently from any one-time signature scheme that is based on one-way functions. The performance of our technique also compares favorably with that of current ones. Besides, it is shown in this paper that our transformation can further be applied to schemes satisfying only a weak variant of unforgeability without any further modification. Furthermore, our technique can also be used for constructing strongly unforgeable signature schemes in other cryptographic settings which include certificateless signature, identity-based signature, and several others. To the best of our knowledge, similar extent of versatility is not known to be supported by any of those comparable techniques. Finally and of independent interest, we show that our generic transformation technique can be modified to an on-line/off-line signature scheme, which possesses a very efficient signing process.