A New Iterative Scheme of Modified Mann Iteration in Banach Space

We introduce the modified iterations of Mann's type for nonexpansive mappings and asymptotically nonexpansive mappings to have the strong convergence in a uniformly convex Banach space. We study approximation of common fixed point of asymptotically nonexpansive mappings in Banach space by using a new iterative scheme. Applications to the accretive operators are also included

Extended D-TomoSAR Displacement Monitoring for Nanjing (China) City Built Structure Using High-Resolution TerraSAR/TanDEM-X and Cosmo SkyMed SAR Data

The availability of high-resolution spaceborne synthetic aperture radar (SAR) data coupled with the ongoing refinement of tomographic SAR (TomoSAR) technology has made use of radar data feasible for preventive monitoring and assessment of built structures. In this study, we first applied extended differential TomoSAR (D-TomoSAR) to a set of 26 scenes of TerraSAR/TanDEM-X (TSX/TDX) (2013–2015) and 32 scenes of Cosmo-SkyMed (CSK) (2015–2017) images to estimate motions of skyscrapers, bridges and historical monuments in Nanjing City, China. The calculation and isolation of unknown parameters in the D-TomoSAR model, including linear velocity, thermal dynamics and structural heights, helped to estimate millimetric statistics of motion time series. Then, aforementioned two SAR datasets were tentatively tested using amplitude dispersion and phase stability indicators, highlighting the performance and sensitivity of X-band SAR in structural displacement monitoring. Experimental results demonstrated that motion indexes, e.g., heterogeneities of thermal amplitudes and spatiotemporal displacements, were useful to evaluate the conditions of built structures being monitored, in particular when their structural topology were visible owing to the enhanced density of persistent scatterer (PS) measurements. This study implies the value of high-resolution D-TomoSAR tools in the preventive monitoring and health diagnosis of built structures elsewhere over the world

Cryptanalysis and Improvement of Three Certificateless Aggregate Signature Schemes

The certificateless aggregate signature (CLAS) scheme is a very important data aggregation technique that compresses a large number of signatures from different users into a short signature. CLAS can reduce the total length of a signature and the computational overhead of signature verification and is therefore highly suitable for resource-constrained network environments. Many CLAS schemes have been proposed in recent years, but the construction of a secure and efficient CLAS scheme remains important. In 2018, Li et al. found that the CLAS scheme proposed by He et al. could not resist malicious-but-passive KGC attacks, and they presented an improved CLAS scheme. Du et al. proposed a CLAS scheme with the constant aggregate signature length and claimed that their scheme was resistant to forgery attacks. Chen et al. designed a CLAS scheme with efficient verification and proved that their CLAS scheme was secure in the random oracle model. In this paper, we demonstrate that Li et al.’s CLAS scheme, Du et al.’s CLAS scheme, and Chen et al.’s CLAS scheme are insecure against coalition attacks and present concrete examples. That is, an attacker can forge a valid aggregate signature using some illegal single signatures. To withstand suck attacks, we propose an improved CLAS scheme based on Chen et al.’s CLAS scheme

Strong Designated Verifier Signature Scheme with Undeniability and Strong Unforgeability in the Standard Model

Strong designated verifier signature can provide an efficient way to protect the identity privacy of the signer and the integrity of the data transmitted over the public channel. These characteristics make it very useful in outsourcing computing, electronic voting, electronic bidding, electronic auction and other fields. However, most strong designated verifier signature schemes are unable to identify the real signature generator when the signer and the designated verifier dispute a signature. In addition, the existing strong designated verifier signature schemes in the standard model rarely satisfy strong unforgeability, and thus cannot prevent the attacker from forging a valid signature on any previously signed message. Therefore, designing a strong designated verifier signature scheme without random oracles that satisfies strong unforgeability and undeniability is very attractive in both practice and theory. Motivated by these concerns, we design the first undeniable strong designated verifier signature scheme without random oracles, in which the arbiter can independently perform the judgment procedure to prove whether a controversial signature is generated by the signer or the designated verifier. Under standard assumptions, the scheme is proved to be strongly unforgeable in standard model. Furthermore, it not only achieves non-transferability and privacy of the signer’s identity but also satisfies the undeniable property of traditional digital signature schemes. Performance analysis results show that the length of the signer’s private key, the designated verifier’s private key and signature length are 40 bits, 40 bits and 384 bits, respectively. Compared with he related schemes, the proposed scheme has higher performance in signature length, private key size and computational overhead. Finally, we show how to apply it to implement outsourcing computation in cloud computing

Cloud server.

Image URL: https://www.iconfont.cn/search/index?searchType=iconq=cloud. (TIF)</p

S5 Fig - CA.

Image URL: https://www.iconfont.cn/search/index?searchType=iconq=host. (TIF)</p