A New Digital Multilevel Proxy Signature Scheme Based on Elliptic Curve Cryptography

Based on the analysis of elliptic curve digital signature algorithm（ECDSA）,aiming at multilevel proxy signature in which the original signer delegates the digital signature authority to several proxies and its security demands, a new multilevel proxy signature scheme based on elliptic curve discrete logarithm problem （ECDLP） is presented and its security are proved.     

Threshold signature scheme based on discrete logarithm and quadratic residue

Digital signature scheme is a very important research field in computer security and modern cryptography. A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme. It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions. In this scheme, effective digital signature can not he generatedby any h 1 or fewer legal users, or only by signature executive. In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature. A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed. The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.     

A Nominative Multi-Proxy Signature Scheme Based on ECC

A nominative multi proxy signature in which the original signer authorizes a group of proxy signers is presented. Meanwhile, our proposed scheme is based on elliptic curve cryptosystem which is more efficient than the corresponding one based on traditional discrete logarithm.     

Research on Secure Authentication Mechanism of Grid

Based on the analysis on the security mechanism of grid, this paper discusses the advantages of latest techniques of grid security, and presents a secure authentication scheme of grid based on elliptic curve cryptosystem （ECC）. The secure authentication scheme may provide reference value for the further application of grid.     

An Efficient Threshold Blind Signature from Weil Pairing

Threshold blind signature is playing an important role in cryptography as well as in practical applications such as e-cash and e-voting systems, etc. In this paper, we present an efficient and practical threshold bind signature from Weil pairing on super-singular elliptic curves or hyper-elliptic curves over finite field and prove that our scheme is provably secure in the random oracle model.     

A Secure MAKAP for Wireless Communication

A mutual authentication and key establishment protocol proposed by Aydos et al, for wireless communication based on elliptic curve cryptography can provide authentication between the user and server and they agreement a session key in the end of it. Unfortunately, Mangipudi pointed out Aydos＇ scheme was incurred the man-in-middle attack denial-of-service attack and impersonation based on man-in-middle attack. Then he proposed an improved scheme m overcome the above weakness. However, there is an attack which can forge the message required in the protocol and impersonation a valid user to the server.     

Security and privacy issues in electronic health network

Electronic health network(EHN) is an information system providing functions involved in e-health. In this paper, we devise mechanisms covering three important security and privacy issues of EHN including trust management, privacy preserving, and data sharing. First, we propose an authenticated key agreement scheme based on hierarchical identity-based signature(HIBS). We abstract a hierarchical architecture from the social network architecture of EHN. To support large-scale scenarios, we introduce a virtual signature generation phase into traditional HIBS, thus our scheme will be efficient even the depth is quite big. Second, we propose a fast data searching scheme based on symmetric searchable encryption(SSE). To improve the searching efficiency, we introduce a two-level cache structure into the traditional SSE. Third, we propose an access control scheme based on hierarchical identitybased encryption(HIBE). To make it a fine-grained scheme, we organize the data owner’s file in hierarchy and introduce a virtual key generation phase to traditional HIBE. Also, the scheme can provide delegation and revocation functions easily. Besides, our schemes guarantee known-key secrecy, forward secrecy, and antidirection secrecy and possess the resistance capability to collude-attack. Evaluation results show that our scheme indeed achieves the security and efficiency.     

A Formal Model for the Security of Proxy Signature Schemes

This paper provides theoretical foundations for the secure proxy signature primitive. We present a formal model for the security of proxy signature schemes, which defines the capabilities of the adversary and the security goals to capture which mean for a proxy signature scheme to be secure. Then, we present an example of proxy signature scheme that can be proven secure in the standard model.     

Cryptanalysis and Improvement of Signcryption Schemes on Elliptic Curves

In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu liang and Hideki lmai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose confidentiality to gain non repudiation. We also propose two improvement versions that not only overcome the security leak inherenl in the schemes but also provide public verifiability or forward security. Our improvement versions require smaller computing cost than that required by signature-thenencryption methods.     

An Efficient ECDSA-Based Signature Scheme for Wireless Networks

Wired equivalent security is difficult to provide in wireless networks due to high dynamics, wireless link vulnerability, and decentralization. The Elliptic Curve Digital Signature Algorithm（ECDSA） has been applied to wireless networks because of its low computational cost and short key size, which reduces the overheads in a wireless environment. This study improves the ECDSA scheme by reducing its time complexity. The significant advantage of the algorithm is that our new scheme needs not to calculate modular inverse operation in the phases of signature generation and signature verification. Such an improvement makes the proposed scheme more efficient and secure.     

Verifiable (t, n) Threshold Signature Scheme Based on Elliptic Curve

0　IntroductionI t’s very important to assure the security of the keys inmany applied fields. A critical technique to prevent the keyfrom leaking is to adopt the threshold cryptosystem. It wasfirst introduced by Shamir in 1979[1] and by Desmedt in1987[2]. In this system, each group, instead of each groupmember, publishes a single group public key. The received ci phertext can only be deciphered properly when the number ofparticipating group members is larger than or equal …     

Fault Tolerant Approach for Data Encryption and Digital Signature Based on ECC System

An integrated fault tolerant approach for data encryption and digital signature based on elliptic curve cryptography is proposed. This approach allows the receiver to verify the sender‘s identity and can simultaneously deal with error detection and data correction. Up to three errors in our approach can be detected and corrected. This approach has atleast the same security as that based on RSA system, but smaller keys to achieve the same level of security. Our approach is more efficient than the known ones and more suited for limited environments like personal digital assistants (PDAs), mobile phones and smart cards without RSA coprocessors.     

Merkle Tree Digital Signature and Trusted Computing Platform

0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di…     

Binary Sequences from a Pair of Elliptic Curves

A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess ＂good＂ cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.     

Architecture of Trusted PC

This paper, focusing on the trusted computing group＇s standards, explained the key concept of trusted compuling and provided the architecture of trusted PC. It built trust bottom-up by starting with trusted hardware and adding layers of trusted software. It is a system-level solution available to all applications running on the member platforms. This solution reduces the security burden on applications and thus simplifies application programming.     

基于ECC的防欺诈门限签名方案

门限答签名是一种由秘密共享和数字签名相结合而产生的签名体制,妥善解决密钥管理中的密钥泄漏和遗失问题,有利于提高系统的安全性.基于椭圆曲线密码体制,利用shamir的门限机制,提出了一种可以防欺诈的门限签名方案.该方案无需可信中心来生成和分发密钥,签名发布时,参与者间无需进行秘密通信,能够有效地抵制群内参与者和群外攻击者的欺诈,同时证明了其正确性和安全性,分析表明该方案的安全性是基于椭圆曲线离散对数问题的难解性,并且无需可信中心.     

基于椭圆曲线公钥密码体制的手机短信加密方案

介绍了手机短信系统的特点以及椭圆曲线公钥密码体制,提出了一种基于椭圆曲线上离散对数问题的手机短信加密方案,实验表明:其安全性高,不易攻破,形式简单,运行速度快.     

An FPGA Implementation of GF （p） Elliptic Curve Cryptographic Coprocessor

A GF (p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrarypoint on a curve defined over GF(2^192-2^64-1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.