High Flexible Sanitizing Signature Scheme Based on Bilinear Maps

Certificateless signature schemes are a very intriguing aspect in information security because of its capability of removing the well-known key escrow problem predominately in ID-based cryptography. He et al. proposed an efficient certificateless aggregate signature scheme and proved that their scheme is secure against all possible types of security attacks. However, the authors still managed to find loopholes in the form of insecurities against ‘honest but curious' and ‘malicious but passive' attacks during cryptanalysis of He et al.'s scheme. The authors propose an efficient certificateless aggregate signature scheme which fills the security gaps in He et al.'s scheme and demonstrate the security in their scheme via a mathematical proof, and reinforce the fact that their scheme is much more efficient in a thorough performance comparison of their scheme against the previous schemes.

Download Full-text

Provably Secure Short Proxy Signature Scheme from Bilinear Maps

2009 International Forum on Information Technology and Applications ◽

10.1109/ifita.2009.323 ◽

2009 ◽

Author(s):

Hu Guozheng ◽

Hong Fan

Keyword(s):

Proxy Signature ◽

Signature Scheme ◽

Bilinear Maps ◽

Provably Secure

Download Full-text

Research on a New Signature Scheme on Blockchain

Security and Communication Networks ◽

10.1155/2017/4746586 ◽

2017 ◽

Vol 2017 ◽

pp. 1-10 ◽

Cited By ~ 4

Author(s):

Chao Yuan ◽

Mi-xue Xu ◽

Xue-ming Si

Keyword(s):

Digital Signature ◽

Discrete Logarithm ◽

Signature Scheme ◽

Bilinear Maps ◽

The Core ◽

Aggregate Signature ◽

Core Technology ◽

Security Properties ◽

And Performance ◽

Inputs And Outputs

With the rise of Bitcoin, blockchain which is the core technology of Bitcoin has received increasing attention. Privacy preserving and performance on blockchain are two research points in academia and business, but there are still some unresolved issues in both respects. An aggregate signature scheme is a digital signature that supports making signatures on many different messages generated by many different users. Using aggregate signature, the size of the signature could be shortened by compressing multiple signatures into a single signature. In this paper, a new signature scheme for transactions on blockchain based on the aggregate signature was proposed. It was worth noting that elliptic curve discrete logarithm problem and bilinear maps played major roles in our signature scheme. And the security properties of our signature scheme were proved. In our signature scheme, the amount will be hidden especially in the transactions which contain multiple inputs and outputs. Additionally, the size of the signature on transaction is constant regardless of the number of inputs and outputs that the transaction contains, which can improve the performance of signature. Finally, we gave an application scenario for our signature scheme which aims to achieve the transactions of big data on blockchain.

Download Full-text

Forward-Secure Linkable Ring Signatures from Bilinear Maps

Cryptography ◽

10.3390/cryptography2040035 ◽

2018 ◽

Vol 2 (4) ◽

pp. 35 ◽

Cited By ~ 2

Author(s):

Xavier Boyen ◽

Thomas Haines

Keyword(s):

Provable Security ◽

Moderate Degree ◽

Security Model ◽

Signature Scheme ◽

Bilinear Maps ◽

Forward Security ◽

Ring Signature ◽

Internet Voting ◽

Ring Signatures ◽

Multilinear Maps

We present the first linkable ring signature scheme with both unconditional anonymity and forward-secure key update: a powerful tool which has direct applications in elegantly addressing a number of simultaneous constraints in remote electronic voting. We propose a comprehensive security model, and construct a scheme based on the hardness of finding discrete logarithms, and (for forward security) inverting bilinear or multilinear maps of moderate degree to match the time granularity of forward security. We prove efficient security reductions—which, of independent interest, apply to, and are much tighter than, linkable ring signatures without forward security, thereby vastly improving the provable security of these legacy schemes. If efficient multilinear maps should ever admit a secure realisation, our contribution would elegantly address a number of problems heretofore unsolved in the important application of (multi-election) practical Internet voting. Even if multilinear maps are never obtained, our minimal two-epoch construction instantiated from bilinear maps can be combinatorially boosted to synthesise a polynomial time granularity, which would be sufficient for Internet voting and more.

Download Full-text

An Efficient and Secure Certificateless Aggregate Signature From Bilinear Maps

International Journal of Information Security and Privacy ◽

10.4018/ijisp.2019100106 ◽

2019 ◽

Vol 13 (4) ◽

pp. 89-108

Author(s):

Pankaj Kumar ◽

Vishnu Sharma ◽

Gaurav Sharma ◽

Tarunpreet Bhatia

Keyword(s):

Information Security ◽

Mathematical Proof ◽

Performance Comparison ◽

Signature Scheme ◽

Bilinear Maps ◽

Security Attacks ◽

Signature Schemes ◽

Key Escrow ◽

Aggregate Signature ◽

Certificateless Signature

Certificateless signature schemes are a very intriguing aspect in information security because of its capability of removing the well-known key escrow problem predominately in ID-based cryptography. He et al. proposed an efficient certificateless aggregate signature scheme and proved that their scheme is secure against all possible types of security attacks. However, the authors still managed to find loopholes in the form of insecurities against ‘honest but curious' and ‘malicious but passive' attacks during cryptanalysis of He et al.'s scheme. The authors propose an efficient certificateless aggregate signature scheme which fills the security gaps in He et al.'s scheme and demonstrate the security in their scheme via a mathematical proof, and reinforce the fact that their scheme is much more efficient in a thorough performance comparison of their scheme against the previous schemes.

Download Full-text

An Efficient Certificateless Aggregate Signature Scheme for Blockchain-Based Medical Cyber Physical Systems

Sensors ◽

10.3390/s20051521 ◽

2020 ◽

Vol 20 (5) ◽

pp. 1521 ◽

Cited By ~ 6

Author(s):

Hong Shu ◽

Ping Qi ◽

Yongqing Huang ◽

Fulong Chen ◽

Dong Xie ◽

...

Keyword(s):

Medical Records ◽

Cyber Physical Systems ◽

Medical Data ◽

Security Requirements ◽

Signature Scheme ◽

Bilinear Maps ◽

Signature Schemes ◽

Physical Systems ◽

Secure Storage ◽

Aggregate Signature

Different from the traditional healthcare field, Medical Cyber Physical Systems (MCPS) rely more on wireless wearable devices and medical applications to provide better medical services. The secure storage and sharing of medical data are facing great challenges. Blockchain technology with decentralization, security, credibility and tamper-proof is an effective way to solve this problem. However, capacity limitation is one of the main reasons affecting the improvement of blockchain performance. Certificateless aggregation signature schemes can greatly tackle the difficulty of blockchain expansion. In this paper, we describe a two-layer system model in which medical records are stored off-blockchain and shared on-blockchain. Furthermore, a multi-trapdoor hash function is proposed. Based on the proposed multi-trapdoor hash function, we present a certificateless aggregate signature scheme for blockchain-based MCPS. The purpose is to realize the authentication of related medical staffs, medical equipment, and medical apps, ensure the integrity of medical records, and support the secure storage and sharing of medical information. The proposed scheme is highly computationally efficient because it does not use bilinear maps and exponential operations. Many certificateless aggregate signature schemes without bilinear maps in Internet of things (IoT) have been proposed in recent years, but they are not applied to the medical field, and they do not consider the security requirements of medical data. The proposed scheme in this paper has high computing and storage efficiency, while meeting the security requirements in MCPS.

Download Full-text