Efficient Identity Based Signcryption Scheme with Public Verifiability and Forward Security

In this paper, we point out that Libert and Quisquater’s signcryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some-what more efficient than Libert and Quisquater’s one.

A Generic Solution to Realize Public Verifiability of Signcryption

Signcryption has been a rapidly emerging efficient approach to achieve authenticity and confidentiality within a logic single step. However, it is still a difficult problem to realize public verifiability of signcryption in an efficient and secure way. Here, we present a generic solution to realize public verifiability based on quadratic residue.

Improved Verifiability Scheme for Data Storage in Cloud Computing

In Cloud computing, data and service requests are responded by remote processes calls on huge data server clusters that are not totally trusted. The new computing pattern may cause many potential security threats. This paper explores how to ensure the integrity and correctness of data storage in cloud computing with user＇s key pair. In this paper, we aim mainly at constructing of a quick data chunk verifying scheme to maintain data in data center by implementing a balance strategy of cloud computing costs, removing the heavy computing load of clients, and applying an automatic data integrity maintenance method. In our scheme, third party auditor （TPA） is kept in the scheme, for the sake of the client, to periodically check the integrity of data blocks stored in data center. Our scheme supports quick public data integrity verification and chunk redundancy strategy. Compared with the existing scheme, it takes the advantage of ocean data support and high performance.

Quantum proxy signature scheme with public verifiability

In recent years, with the development of quantum cryptography, quantum signature has also made great achievement. However,the effectiveness of all the quantum signature schemes reported in the literature can only be verified by a designated person.Therefore, its wide applications are limited. For solving this problem, a new quantum proxy signature scheme using EPR quantumentanglement state and unitary transformation to generate proxy signature is presented. Proxy signer announces his public key whenhe generates the final signature. According to the property of unitary transformation and quantum one-way function, everyone canverify whether the signature is effective or not by the public key. So the quantum proxy signature scheme in our paper can be publicverified. The quantum key distribution and one-time pad encryption algorithm guarantee the unconditional security of this scheme.Analysis results show that this new scheme satisfies strong non-counterfeit and strong non-disavowal.

A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))

In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security.

DNATyper^(TM)21与Verifiler^(TM)Plus试剂盒对常规案件检材检验的比较

本文通过比较DNATyper^(TM)21与Verifi ler^(TM)Plus两种STR检测试剂盒对各类案件检材的检验能力,探讨DNATyper^(TM)21试剂盒在常规案件检验中应用的可靠性。取0.03125、0.0625、0.125、0.25、0.5、1.0 ng/μL基因组标准品对两种试剂盒进行灵敏度测试;应用DNATyper^(TM)21与Verifi ler^(TM)Plus试剂盒分别对1056例常规案件检材DNA进行检验;对同一样本等位基因进行一致性比较。结果表明,两种试剂盒均可以成功检测出模板浓度在0.0625 ng/μL以上的标准DNA。在检验的1056例样本中,DNATyper^(TM)21试剂盒共检出881例,检出率为83.4%;Verifi ler^(TM)Plus试剂盒检出892例,检出率为84.5%。统计学结果表明两种试剂盒检出率无统计学差异,且同一样本相同基因座得到的等位基因分型一致。综上,DNATyper^(TM)21试剂盒对各类常规检材具有良好的检验能力,可应用于日常案件检验。

Establishment and validation of a predictive model for peripherally inserted central catheter-related thrombosis in patients with liver cancer

BACKGROUND Peripherally inserted central catheters(PICCs)are commonly used in hospitalized patients with liver cancer for the administration of chemotherapy,nutrition,and other medications.However,PICC-related thrombosis is a serious complication that can lead to morbidity and mortality in this patient population.Several risk factors have been identified for the development of PICC-related thrombosis,including cancer type,stage,comorbidities,and catheter characteristics.Understanding these risk factors and developing a predictive model can help healthcare providers identify high-risk patients and implement preventive measures to reduce the incidence of thrombosis.AIM To analyze the influencing factors of PICC-related thrombosis in hospitalized patients with liver cancer,construct a predictive model,and validate it.METHODS Clinical data of hospitalized patients with liver cancer admitted from January 2020 to December 2023 were collected.Thirty-five cases of PICC-related thrombosis in hospitalized patients with liver cancer were collected,and 220 patients who underwent PICC placement during the same period but did not develop PICC-related thrombosis were randomly selected as controls.A total of 255 samples were collected and used as the training set,and 77 cases were collected as the validation set in a 7:3 ratio.General patient information,case data,catheterization data,coagulation indicators,and Autar Thrombosis Risk Assessment Scale scores were analyzed.Univariate and multivariate unconditional logistic regression analyses were performed on relevant factors,and the value of combined indicators in predicting PICC-related thrombosis in hospitalized patients with liver cancer was evaluated using receiver operating characteristic(ROC)curve analysis.RESULTS Univariate analysis showed statistically significant differences(P<0.05)in age,sex,Karnofsky performance status score(KPS),bedridden time,activities of daily living impairment,parenteral nutrition,catheter duration,distant metastasis,and bone marrow suppression between the thrombosis group and the non-thrombosis group.Other aspects had no statistically significant differences(P>0.05).Multivariate regression analysis showed that age≥60 years,KPS score≤50 points,parenteral nutrition,stage III to IV,distant metastasis,bone marrow suppression,and activities of daily living impairment were independent risk factors for PICC-related thrombosis in hospitalized patients with liver cancer(P<0.05).Catheter duration of 1-6 months and catheter duration>6 months were protective factors for PICC-related thrombosis(P<0.05).The predictive model for PICC-related thrombosis was obtained as follows:P predictive probability=[exp(Logit P)]/[1+exp(Logit P)],where Logit P=age×1.907+KPS score×2.045+parenteral nutrition×9.467+catheter duration×0.506+tumor-node-metastasis(TNM)staging×2.844+distant metastasis×2.065+bone marrow suppression×2.082+activities of daily living impairment×13.926.ROC curve analysis showed an area under the curve(AUC)of 0.827(95%CI:0.724-0.929,P<0.001),with a corresponding optimal cut-off value of 0.612,sensitivity of 0.755,and specificity of 0.857.Calibration curve analysis showed good consistency between the predicted occurrence of PICC-related thrombosis and actual occurrence(P>0.05).ROC analysis showed AUCs of 0.888 and 0.729 for the training and validation sets,respectively.CONCLUSION Age,KPS score,parenteral nutrition,TNM staging,distant metastasis,bone marrow suppression,and activities of daily living impairment are independent risk factors for PICC-related thrombosis in hospitalized patients with liver cancer,while catheter duration is a protective factor for the disease.The predictive model has an AUC of 0.827,indicating high predictive accuracy and clinical value.

A Composite Ansatz for Calculation of Dynamical Structure Factor

We propose an ansatz without adjustable parameters for the calculation of a dynamical structure factor.The ansatz combines the quasi-particle Green’s function,especially the contribution from the renormalization factor,and the exchange-correlation kernel from time-dependent density functional theory together,verified for typical metals and semiconductors from a plasmon excitation regime to the Compton scattering regime.It has the capability to reconcile both small-angle and large-angle inelastic x-ray scattering(IXS)signals with muchimproved accuracy,which can be used as the theoretical base model,in inversely inferring electronic structures of condensed matter from IXS experimental signals directly.It may also be used to diagnose thermal parameters,such as temperature and density,of dense plasmas in x-ray Thomson scattering experiments.

P_(c)(4457)Interpreted as a J^(P)=1/2+State by D^(0)∧_(c)^(+)(2595)-π^(0)P_(c)(4312) Interaction

P_(c)(4457)has been discovered over five years,but the parity of this particle remains undetermined.We propose a new interpretation for P_(c)(4457),which is the state generated from the coupled-channel D^(0)Ac+(2595)andπ^(0)P_(c)(4312)since they can exchange an almost on-shell∑_(c)^(+).In this scenario,the parity of P_(c)(4457)will be positive,which is different from the candidate of the bound state of D*∑_(c).The main decay channel of P_(c)(4457)in this model is Pc(4312)π.We propose three processes∧_(b)^(0)→J/ψKapπ^(-),∧_(b)^(0)→J/ψK-pπ^(0),and∧_(b)^(0)→J/ψpπ^(-)π^(+)k^(-)to verify Pc(4457)→Pc(4312)π.

Improved key exchange protocol for three-party based on verifier authentication

To prevent server compromise attack and password guessing attacks,an improved and efficient verifier-based key exchange protocol for three-party is proposed,which enables two clients to agree on a common session key with the help of the server.In this protocol,the client stores a plaintext version of the password,while the server stores a verifier for the password.And the protocol uses verifiers to authenticate between clients and the server.The security analysis and performance comparison of the proposed protocol shows that the protocol can resist many familiar attacks including password guessing attacks,server compromise attacks,man-in-the-middle attacks and Denning-Sacco attacks,and it is more efficient.

A leap by the rise of solid-state electrolytes for Li-air batteries

Li-air batteries have attracted extensive attention because of their ultrahigh theoretical energy density. However, the potential safety hazard of flammable organic liquid electrolytes hinders their practical applications. Replacing liquid electrolytes with solidstate electrolytes(SSEs) is expected to fundamentally overcome the safety issues. In this work, we focus on the development and challenge of solid-state Li-air batteries(SSLABs). The rise of different types of SSEs, interfacial compatibility and verifiability in SSLABs are presented. The corresponding strategies and prospects of SSLABs are also proposed. In particular, combining machine learning method with experiment and in situ(or operando)techniques is imperative to accelerate the development of SSLABs.

Novel traveling quantum anonymous voting scheme via GHZ states

Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

PVF-DA: Privacy-Preserving, Verifiable and FaultTolerant Data Aggregation in MEC

As an emergent-architecture, mobile edge computing shifts cloud service to the edge of networks. It can satisfy several desirable characteristics for Io T systems. To reduce communication pressure from Io T devices, data aggregation is a good candidate. However, data processing in MEC may suffer from many challenges, such as unverifiability of aggregated data, privacy-violation and fault-tolerance. To address these challenges, we propose PVF-DA: privacy-preserving, verifiable and fault-tolerant data aggregation in MEC based on aggregator-oblivious encryption and zero-knowledge-proof. The proposed scheme can not only provide privacy protection of the reported data, but also resist the collusion between MEC server and corrupted Io T devices. Furthermore, the proposed scheme has two outstanding features: verifiability and strong fault-tolerance. Verifiability can make Io T device to verify whether the reported sensing data is correctly aggregated. Strong fault-tolerance makes the aggregator to compute an aggregate even if one or several Io Ts fail to report their data. Finally, the detailed security proofs are shown that the proposed scheme can achieve security and privacy-preservation properties in MEC.

Improvement of publicly verifiable authenticated encryption scheme

A weakness of unforgeability is found in Ma and Chen scheme, and the root cause is the susceptive linear design in the scheme. In order to avoid the weakness and susceptive linear design, an improvement by means of two mechanisms including quadratic residue and composite discrete logarithm is proposed, which can defeat the forgery attacks in Ma and Chen scheme. The new scheme remains good confidentiality, public verifiability and efficiency.

A Public Verifiable Identity Based Signcryption in the Random Oracle Model

Since Libert and Quisquater's identity based signcryption scheme cannot provide public verifiability after research, the paper proposes a new identity based signcryption scheme. The scheme uses quadratic residue and pairings over elliptic curves to realize public verifiability. By analysis the scheme is proved to be more efficient than Libert and Quisquater's scheme. Moreover, a security proof of the original scheme is presented in the random oracle model.

Data Integrity Checking Protocol with Data Dynamics in Cloud Computing

We introduce a model for provable data possession (PDP) which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. In a previous work, Ateniese et al. proposed a remote data integrity checking protocol that supports data partial dynamics. In this paper, we present a new remote data possession checking protocol which allows an unlimited number of file integrity verifications and efficiently supports dynamic operations, such as data modification, deletion, insertion and append. The proposed protocol supports public verifiability. In addition, the proposed protocol does not leak any private information to third-party verifiers. Through a specific analysis, we show the correctness and security of the protocol. After that, we demonstrate the proposed protocol has a good performance.

Limits of Level 3 Fair Value Measurement： Based on Conceptual Framework

The IASB stated that in the review of the conceptual framework, if measurement uncertainty is very high, a measurement basis different from fair value may provide more appropriate information. Level 3 fair value measurements are inappropriate for areas （called ＂Level 4＂ by the author） in which models are not formulated and that have material uncertainty in measurement. The purpose of this paper is to elucidate ＂measurement uncertainty＂, which impacts ＂faithful representation＂ in fair value measurement, from the perspective of ＂verifiability＂. To do so, it will employ a conceptual examination of the limits of Level 3 fair value measurement based on IFRS 13 （Fair Value Measurement）. While taking into consideration recent discussions on reviewing conceptual framework, the author will reorganize the conceptual categories of verifiability （i.e., clarification of the ＂reasonable verifiability＂ categories） to underpin the fact that material uncertainties in measurement have obstructed constructing faithful representation. In addition, the author will discuss the problem that the dichotomy of direct and indirect found in IASB is not accurate enough to fully understand the concept of verifiability. In this context, the author will also suggest that the concept of verifiability, reorganized through ＂reasonable verifiability＂, can satisfy the requirements for constructing faithful representation.

Distributed Secure Storage Scheme Based on Sharding Blockchain

Distributed storage can store data in multiple devices or servers to improve data security.However,in today’s explosive growth of network data,traditional distributed storage scheme is faced with some severe challenges such as insufficient performance,data tampering,and data lose.A distributed storage scheme based on blockchain has been proposed to improve security and efficiency of traditional distributed storage.Under this scheme,the following improvements have been made in this paper.This paper first analyzes the problems faced by distributed storage.Then proposed to build a new distributed storage blockchain scheme with sharding blockchain.The proposed scheme realizes the partitioning of the network and nodes by means of blockchain sharding technology,which can improve the efficiency of data verification between nodes.In addition,this paper uses polynomial commitment to construct a new verifiable secret share scheme called PolyVSS.This new scheme is one of the foundations for building our improved distributed storage blockchain scheme.Compared with the previous scheme,our new scheme does not require a trusted third party and has some new features such as homomorphic and batch opening.The security of VSS can be further improved.Experimental comparisons show that the proposed scheme significantly reduces storage and communication costs.

A New Rational Secret Sharing Scheme

In this paper,we propose a new approach for rational secret sharing in game theoretic settings.The trusted center is eliminated in the secret reconstruction phase.Every player doesn’t know current round is real round or fake round.The gain of following the protocol is more than the gain of deviating,so rational player has an incentive to abide the protocol.Finally,every player can obtain the secret fairly.Our scheme is verifiable and any player’s cheating can not work.Furthermore the proposed scheme is immune to backward induction and satisfies resilient equilibrium.No player of the coalition C can do better,even if the whole coalition C cheats.Our scheme can withstand the conspiracy attack with at most m-1 players.

浅析人脸识别解锁系统的现状与展望

作为人工智能中人脸识别的技术之一,人脸识别是对人的面部特征与信息进行采集,对显示的面部影像,首先检测在拍摄镜头中是否有人脸,若检测到人脸,则进一步的给出脸的位置、形状和各个面部器官的坐标、形状等信息。处理器提取信息后,将其与已知的面部特征进行对比,从而识别用户的身份。它包括人脸检测、人脸跟踪、人脸对比三项主要内容。而人脸识别解锁系统就是基于人脸识别技术的基础上,通过识别人脸来对户与设备中存储的人脸信息进行比对进而判断该用户是否能够进入系统的技术。用户通过电子设备的摄像头拍摄自己的面部影像,使设备预先记录下了本人的面部信息。然后再通过摄像头对采集的影像进行比对进而开放设备。如果登录用户的脸与"预先设定的身份认证信息"比对结果成功,那么用户就可进入并使用设备。