Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then- encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.

Soliton Solutions of Coupled KdV System from Hirota's Bilinear Direct Method

With Hirota＇s bilinear direct method, we study the special coupled KdV system to obtain its new soliton solutions. Then we further discuss soliton evolution, corresponding structures, and interesting interactive phenomena in detail with plot. As a result, we find that after the interaction, the solitons make elastic collision and there are no exchanges of their physical quantities including energy, velocity and shape except the phase shift.

A new improved ID-based proxy ring signature scheme from bilinear pairings

Ring signature and proxy signature are of vital importance to secure electronic commerce. Recently, the bilinear pairing such as Well pairing or Tate pairing on elliptic curves and hyperelliptic curves is playing an important role in security solutions. Several ID-based signature schemes have been put forward, many of which are based on bilinear pairings. In key management and moderate security demand scenarios, ID-based public key cryptosystem is more preferable than other public key infrastructure based systems. In this paper, an improved ID-based proxy ring signature scheme from bilinear pairings is proposed which combines the advantages of proxy signature and of ring signatures. Our scheme can guarantee the profits of the proxy signer via preventing the original signer form generating the proxy ring signature. Furthermore, bilinear pairings are introduced to minimize the computation overhead and to improve the related performance of our scheme. In contrast with Zhang＇s scheme, our scheme is a computational efficiency improvement for signature verification because the computational cost of bilinear pairings required is reduced from O（n） to O（ 1 ）. In addition, the proxy ring signature presented in this paper can perfectly satisfy all the security requirements of proxy ring signature, i. e. signer-ambiguity, non-forgeability, verification, non-deniability and distinguishability.

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.

A NEW MULTI-PROXY SIGNATURE FROM BILINEAR PAIRING

Proxy signatures are very useful tools when one needs to delegate his/her signing capability to other parties. In this paper,a new multi-proxy signature scheme is proposed. The new scheme is constructed from bilinear pairings using Boneh,Lynn,and Shacham’s (BLS) short signatures. The proxy key for the proxy group is just a short signature on the proxy warrant generated by the original signer. Due to the use of short signatures,our scheme is not only efficient,but also satisfies all the security requirements of the strong proxy signature.

Identity Based Group Key Agreement from Bilinear Pairing

We present a provably secure authenticated tree based key agreement scheme for multicast. There is a wide variety of applications that can benefit from using our scheme, e. g. , pay-Tv, teleconferencing, software updates. Compared with the previous published schemes, our scheme provides group member authentication without introducing additional mechanism. Future, we give the security proof of our scheme under the random oracle model.

A PROVABLY SECURE PROXY SIGNATURE SCHEME FROM BILINEAR PAIRINGS

A proxy signature allows an entity, called original signer, to delegate its signing power to another entity, called proxy signer, to sign messages on its behalf. Proxy signatures have many practical applications and are very important cryptographic protocol. In this paper, we propose an efficient proxy signature scheme from bilinear pairings. We prove it secure in the random oracle model and analyze computation cost of our scheme. Our scheme satisfies all the properties required for proxy signatures.

Provably Secure Short Proxy Signature Scheme from Bilinear Maps

An enhanced formal model of security for proxy signature schemes is presented and a provably secure short proxy signature scheme is proposed from bilinear maps. The proposed proxy signature scheme is based on two short secure signature schemes. One is used for delegating the signing rights and computing the standard signature; the other is used for computing proxy signature. Finally, a security proof of the proposed proxy signature scheme is showed by reducing tightly the security of the proposed proxy signature scheme to the security of the two basic signature schemes. The proposed proxy signature scheme has the shortest ordinary signatures and proxy signatures. Moreover, the proxy signature generation needs no pairing operation and verification needs just two pairing operation.

BACNN: Multi-scale feature fusion-based bilinear attention convolutional neural network for wood NIR classification

Effective development and utilization of wood resources is critical.Wood modification research has become an integral dimension of wood science research,however,the similarities between modified wood and original wood render it challenging for accurate identification and classification using conventional image classification techniques.So,the development of efficient and accurate wood classification techniques is inevitable.This paper presents a one-dimensional,convolutional neural network(i.e.,BACNN)that combines near-infrared spectroscopy and deep learning techniques to classify poplar,tung,and balsa woods,and PVA,nano-silica-sol and PVA-nano silica sol modified woods of poplar.The results show that BACNN achieves an accuracy of 99.3%on the test set,higher than the 52.9%of the BP neural network and 98.7%of Support Vector Machine compared with traditional machine learning methods and deep learning based methods;it is also higher than the 97.6%of LeNet,98.7%of AlexNet and 99.1%of VGGNet-11.Therefore,the classification method proposed offers potential applications in wood classification,especially with homogeneous modified wood,and it also provides a basis for subsequent wood properties studies.

Direct scaling of residual displacements for bilinear and pinching oscillators

The estimation of residual displacements in a structure due to an anticipated earthquake event has increasingly become an important component of performance-based earthquake engineering because controlling these displacements plays an important role in ensuring cost-feasible or cost-effective repairs in a damaged structure after the event.An attempt is made in this study to obtain statistical estimates of constant-ductility residual displacement spectra for bilinear and pinching oscillators with 5%initial damping,directly in terms of easily available seismological,site,and model parameters.None of the available models for the bilinear and pinching oscillators are useful when design spectra for a seismic hazard at a site are not available.The statistical estimates of a residual displacement spectrum are proposed in terms of earthquake magnitude,epicentral distance,site geology parameter,and three model parameters for a given set of ductility demand and a hysteretic energy capacity coefficient in the case of bilinear and pinching models,as well as for a given set of pinching parameters for displacement and strength at the breakpoint in the case of pinching model alone.The proposed scaling model is applicable to horizontal ground motions in the western U.S.for earthquake magnitudes less than 7 or epicentral distances greater than 20 km.

Efficient Certificateless Authenticated Key Agreement Protocol from Pairings

In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/server setting is proposed, which uses pairings on certain elliptic curves. We show that the newly proposed key agreement protocol is practical and of great efficiency, meanwhile, it satisfies every desired security require ments for key agreement protocols.

SLIDING-MODE CONTROL OF UNOERTAINTY BILINEAR SYSTEM

In this paper,the sliding-mode control of a bilinear system is studied. It improves the dynamicresponse of the closedweloop system around the original point and is rather robust to the bounded disturbance. At last,the model of an ammonia synthesis reactor is adopted to illustrate the phenomenon described.

A theoretical study of the multigrid three-dimensional variational data assimilation scheme using a simple bilinear interpolation algorithm

In order to solve the so-called ＂bull-eye＂ problem caused by using a simple bilinear interpolation as an observational mapping operator in the cost function in the multigrid three-dimensional variational （3DVAR） data assimilation scheme, a smoothing term, equivalent to a penalty term, is introduced into the cost function to serve as a means of troubleshooting. A theoretical analysis is first performed to figure out what on earth results in the issue of ＂bull-eye＂, and then the meaning of such smoothing term is elucidated and the uniqueness of solution of the multigrid 3DVAR with the smoothing term added is discussed through the theoretical deduction for one-dimensional （1D） case, and two idealized data assimilation experiments （one- and two-dimensional （2D） cases）. By exploring the relationship between the smoothing term and the recursive filter theoretically and practically, it is revealed why satisfied analysis results can be achieved by using such proposed solution for the issue of the multigrid 3DVAR.

Non-fragile guaranteed cost control of discrete-time fuzzy bilinear system

This paper focuses on the problem of non-fragile guaranteed cost control for a class of T-S discrete-time fuzzy bilinear systems（DFBS）.Based on the parallel distributed compensation（PDC） approach,the sufficient conditions are derived such that the closed-loop system is asymptotically stable and the cost function value is no more than a certain upper bound in the presence of the additive controller gain perturbations.The non-fragile guaranteed cost controller can be obtained by solving a set of bilinear matrix inequalities（BMIs）.The Van de Vusse model is utilized to demonstrate the validity and effectiveness of the proposed approach.

NEW ID-BASED GROUP SIGNATURE FROM PAIRINGS

We argue that traditional identity-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we first propose new ID-based public key systems without trusted PKG (Private Key Generator) from bilinear pairings. In our new ID-based systems, if the dishonest PKG impersonates an honest user to communicate with others, the user can provide a proof of treachery of the PKG afterwards, which is similar to certificate-based systems. Therefore, our systems reach the Girault’s trusted level 3. We then propose a group signature scheme under the new ID-based systems, the security and performance of which rely on the new systems. The size of the group public key and the length of the signature are independent on the numbers of the group.

Bilinear Bäcklund Transformation for a Variable-Coefficient Kadomtsev–Petviashvili Equation

Resorting to the Hirota bilinear form,a bilinear Bäcklund transformation(BT)is obtained for a variable-coefficient Kadomtsev–Petviashvili equation.As applications,based on the resulting bilinear BT,single-soliton solutions and two-soliton solutions together with their soliton characteristics are presented for the equation.Furthermore,starting from the bilinear BT,a Lax pair and a new variable-coefficient(2+1)-dimensional nonlinear evolution equation is derived.

Design of a bilinear fault detection observer for singular bilinear systems

A bilinear fault detection observer is proposed for a class of continuous time singular bilinear systems subject to unknown input disturbance and fault. By singular value decomposition on the original system, a bilinear fault detection observer is proposed for the decomposed system via an algebraic Riccati equation, and the domain of attraction of the state estimation error is estimated. A design procedure is presented to determine the fault detection threshold. A model of flexible joint robot is used to demonstrate the effectiveness of the proposed method.

Static output feedback control for discrete-time fuzzy bilinear system

The problem of designing fuzzy static output feedback controller for T-S discrete-time fuzzy bilinear system （DFBS） is presented. Based on parallel distribution compensation method, some sufficient conditions are derived to guarantee the stability of the overall fuzzy system. The stabilization conditions are further formulated into linear matrix inequality （LMI） so that the desired controller can be easily obtained by using the Matlab LMI toolbox. In comparison with the existing results, the drawbacks, such as coordinate transformation, same output matrices, have been elim- inated. Finally, a simulation example shows that the approach is effective.

Lump,lumpoff and predictable rogue wave solutions to a dimensionally reduced Hirota bilinear equation

We study a simplified(3+1)-dimensional model equation and construct a lump solution for the special case of z=y using the Hirota bilinear method.Then,a more general form of lump solution is constructed,which contains more arbitrary autocephalous parameters.In addition,a lumpoff solution is also derived based on the general lump solutions and a stripe soliton.Furthermore,we figure out instanton/rogue wave solutions via introducing two stripe solitons.Finally,one can better illustrate these propagation phenomena of these solutions by analyzing images.

An Improved Traitor Tracing Scheme Based on Bilinear Map

T6 et al presented a bilinear-map-based traitor tracing scheme（TSZ scheme） with revocation, but it is a symmetric scheme because it does not provide non-repudiation. In this paper, an improved TSZ scheme was proposed by using oblivious polynomial evaluation （OPE） protocol and service parameters. Under the recondition of general sameness capabilities of both TSZ and improved TSZ scheme, the new scheme adds some advantages such as providing multi-service capability, user＇s non-repudiation and data provider＇s no-framing innocent users. Furthermore, it is also proved to be semantically secure under the decisional bilinear Diffie-Hellman （DBDH problem） assumption.