Construction of authentication codes with distrust arbitration from polynomials over finite fields

来源 :中国邮电高校学报(英文版) | 被引量 : 0次 | 上传用户:zhuxuchen0822
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
The authentication codes with arbitration are able to solve dispute between the sender and the receiver.The authentication codes with trusted arbitration are called A2-codes,the authentication codes with distrust arbitration are called A3-codes.As an expansion of A2-codes,an A3-code is an authentication system which is closer to the reality environment.Therefore,A3-codes have more extensive application value.In this paper,we construct a class of A3-codes based on polynomials over finite fields,give the parameters of the constructed codes,and calculate a variety of cheating attacks the maximum probabilities of success.Especially,in a special case,the constructed A3-codes are perfect.Compared with a known type of codes,they have almost the same security level,however,our codes need less storage requirements.Therefore,our codes have more advantages.
其他文献
Anomaly detection in smart grid is critical to enhance the reliability of power systems.Excessive manpower has to be involved in analyzing the measurement data collected from intelligent motoring devices while performance of anomaly detection is still not
Novel high power supply rejection ratio (PSRR) high-order temperature-compensated subthreshold metal-oxidesemiconductor (MOS) bandgap reference (BGR) is proposed in Semiconductor Manufacturing International Corporation (SMIC) 0.13 μm complementary MOS (CM
The popularity of IEEE 802.11 based wireless local area network (WLAN) increased significantly in recent years and resulted in the dense deployment of WLANs.While densification can contribute to increasing coverage,it could also lead to increasing interfe
Cloud download service,as a new application which downloads the requested content offiine and reserves it in cloud storage until users retrieve it,has recently become a trend attracting millions of users in China.In the face of the dilemma between the gro
Rough set theory is an important tool to solve uncertain problems.Attribute reduction,as one of the core issues of rough set theory,has been proven to be an effective method for knowledge acquisition.Most of heuristic attribute reduction algorithms usuall
The reachability problem of synchronizing transitions bounded Petri net systems (BPNSs) is investigated in this paper by constructing a mathematical model for dynamics of BPNS.Using the semi-tensor product (STP) of matrices,the dynamics of BPNSs,which can
The rapid development of location-based social networks (LBSNs) has provided an unprecedented opportunity for better location-based services through point-of-interest (POI) recommendation.POI recommendation is personalized,location-aware,and context depen