Dynamic Group Signature Scheme on Lattice with Verifier-local Revocation

The verifier-local revocation mechanism (VLR) is an ideal function of group signature. As long as the verifier knows the revocation list, he/she can verify the legitimacy of the signer, prevent the revoked user from impersonating a legitimate user for signature, ensure the timeliness of signature information and save resources. Group signature is often required to realize users\u27 dynamic addition and revocation. Therefore, an efficient lattice signature scheme with a local revocation mechanism and alter the number of users has become an important topic. In this paper, a zero-knowledge proof scheme on the lattice has been proposed. Based on it, a group signature scheme with VLR has been constructed. This scheme can effectively join and revocation without generating the key pair again. The tracking mechanism uses an encryption scheme. As long as given a correct tracking key, the signer index can be opened quickly. And this algorithm has short public key, logarithmic signature length, and efficient implementation of the VLR function

Evaluations of 5-fluorourcil treated lung cancer cells by atomic force microscopy

Atomic force microscopy (AFM) can be used to obtain the physical information of single live cancer cells; however, the physical changes in live cells with time based on AFM remain to be studied, which play a key role in the evaluation of the efficacy and side effects of drugs. Herein, the treatment of the A549 cell line with the anticarcinogen 5-fluorouracil has been discussed based on the AFM analysis of their continuous physical changes, including their surface morphology, height, adhesion and Young's modulus, with time. In comparison, the African green monkey kidney (Vero) cell line was tested as normal cells to determine the side effects of 5-fluorouracil. The results show that the optimal concentration of 5-fluorouracil is about 500 μM, which presents the best anticancer effect and mild side effects

Label enhanced and patch based deep learning for phase retrieval from single frame fringe pattern in fringe projection 3D measurement

We propose a label enhanced and patch based deep learning phase retrieval approach which can achieve fast and accurate phase retrieval using only several fringe patterns as training dataset. To the best of our knowledge, it is the first time that the advantages of the label enhancement and patch strategy for deep learning based phase retrieval are demonstrated in fringe projection. In the proposed method, the enhanced labeled data in training dataset is designed to learn the mapping between the input fringe pattern and the output enhanced fringe part of the deep neural network (DNN). Moreover, the training data is cropped into small overlapped patches to expand the training samples for the DNN. The performance of the proposed approach is verified by experimental projection fringe patterns with applications in dynamic fringe projection 3D measurement

Label enhanced and patch based deep learning for phase retrieval from single frame fringe pattern in fringe projection 3D measurement

We propose a label enhanced and patch based deep learning phase retrieval approach which can achieve fast and accurate phase retrieval using only several fringe patterns as training dataset. To the best of our knowledge, it is the first time that the advantages of the label enhancement and patch strategy for deep learning based phase retrieval are demonstrated in fringe projection. In the proposed method, the enhanced labeled data in training dataset is designed to learn the mapping between the input fringe pattern and the output enhanced fringe part of the deep neural network (DNN). Moreover, the training data is cropped into small overlapped patches to expand the training samples for the DNN. The performance of the proposed approach is verified by experimental projection fringe patterns with applications in dynamic fringe projection 3D measurement

Efficient and fully simulated oblivious transfer protocol on elliptic curve

Oblivious transfer protocol, an important technology in secure multi-party computation, is the research hotspot on network and information security.Based on the bilinear pairs and the difficult problems on elliptic curves, an efficient 1-out-of-N oblivious transfer protocol in the semi-honest model and in the standard malicious model were proposed respectively.The protocol in semi-honest model was designed.It only needed two rounds of interaction.The receiver needed two times of bilinear pair arithmetic and one time of multi point arithmetic, and the sender needed n times of multi point arithmetic and n times of modular exponentiation.The security of the protocol was based on the discrete logarithm problem on elliptic curves.A zero-knowledge proof protocol and the oblivious transfer protocol in the standard malicious model were proposed respectively.The oblivious transfer protocol only needed four rounds of interaction.The receiver needed three times of bilinear pair arithmetic and three times of multi point arithmetic, and the sender needed n+1 times of multi point arithmetic and n+1 times of modular exponentiation.Besides, it can resist malicious behaviors of the party.The results show that the average running time of the protocol in the semi-honest model and in the standard malicious model were 0.787 9 s and 1.205 6 s respectively, which can further demonstrate the efficiency of the protocol

Universally Composable Oblivious Transfer with Low Communication

In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communication is built. This protocol obtained full simulation security based on the modulo learning with rounding (Mod-LWR) assumption. It can achieve universally composable security in the random oracle machine (ROM) model by combining random OT based on the key exchange protocol with the authentication encryption algorithm. It can be proven to resist static adversary attacks by simulating all corruption cases. Based on computer simulation and detailed mathematical derivation, this protocol was practicable and had better efficiency and lower communication

Early Mesozoic Anatexis‐Induced Strain Partitioning and Gneiss Doming in the Yunkai Massif, South China: A Response to Contrasted Dynamics of Paleo‐Pacific and Paleo‐Tethys Subductions?

International audienceThis study aims to decipher the structural impact of late anatexis in the core of polycyclic basements, like the Cathaysia Block (South China). Based on field mapping and detailed structural and kinematic analyses in the southern part of the Yunkai massif, we document anatexis-induced strain partitioning and gneiss dome formation. The exhumation of migmatites within gneiss domes occurred in a context of NE-SW regional extension coupled with syn-anatexis (a) horizontal lateral flow and vertical one in their cores, (b) strike-slip dominated flow at the limbs of domes, and (c) constrictive lateral flow at the external parts. Petrographic and microstructural analyses suggest that the cores of the gneiss domes and plutons recorded magmatic to sub-solidus deformation while strain localization at the top of gneiss domes is characterized by retrogressive shearing. Zircons U-Pb dating of diatexites and late-kinematic plutons give coherent crystallization ages of ca. 240 Ma, suggesting that the regional partial melting and gneiss doming occurred in the Triassic and probably as early as Late Permian, rather than during the Early Paleozoic as previously thought. A regional NE-SW lateral flow in the deep crust is fully compatible with NW-SE horizontal shortening, as also exemplified for Late Permian to Middle Triassic times in the whole Cathaysia and the Xuefengshan belt. Therefore, the Yunkai massif should no longer be considered as belonging to the Indosinian belt, instead, orogen-parallel crustal flow in the Yunkai massif looks rather controlled by the subduction of the Paleo-Pacific plate at the eastern margin of the South China Block