Digital Multi-signature Scheme Research Articles

An efficient multi-receiver certificate less digital multisignature scheme with anonymity

Certificate-less (CL) signature schemes were presented to deal with key escrow issue in ID based signature. In recent years a number of digital signatures schemes with bilinear pairing have been presented to maintain information security and integrity. Acutely, the greater part of them endure intent security invasion. They don’t enforce in terms of computing and dissemination complications. Many researchers have proposed different schemes on anonymity for multi receiver identity based cryptography. In this paper an attempt has been made to propose an efficient CL Digital Multi-Receiver (CL-DMS) scheme with anonymity without bilinear pairing which is secure against foregeability, key replacement and key escrow attack. Our motivation is to design a CL DMS that simulcast a message with high level of computation efficiency and employs security that only proficient recipients can fetch the message. This will also include the non-repudiation as well as the time replay attack. We presented an enhanced and efficient scheme, which is secure against Type 1, and Type II attacks. We also compare the proposed scheme with some existing schemes in terms of computation and communication cost with higher level of security.

Design of a provably secure identity-based digital multi-signature scheme using biometrics and fuzzy extractor

A novel biometric identity-based digital multi-signature BIO-IDMS scheme is put forwarded in this paper. The proposed scheme is constructed with the help of fuzzy extractor and elliptic curve bilinear pairings. Furthermore, we designed the formal model and the security model of the proposed BIO-IDMS scheme. The formal security analysis demonstrates that the forgery of the proposed scheme is infeasible in the random oracle model based on the intractability assumption of the computational Diffie-Hellman CDH problem. The proposed scheme outperforms in terms of computational cost compared with other related existing multi-signature schemes. Copyright © 2016 John Wiley & Sons, Ltd.

A pairing-free certificateless digital multisignature scheme using elliptic curve cryptography

ABSTRACTIn a digital multisignature scheme, two or more signers are allowed to produce a single signature on a common message, which can be verified by anyone. In the literature, many schemes are available based on the public key infrastructure or identity-based cryptosystem with bilinear pairing and map-to-point (MTP) hash function. The bilinear pairing and the MTP function are time-consuming operations and they need a large super-singular elliptic curve group. Moreover, the cryptosystems based on them are difficult to implement and less efficient for practical use. To the best of our knowledge, certificateless digital multisignature scheme without pairing and MTP hash function has not yet been devised and the same objective has been fulfilled in this paper. Furthermore, we formally prove the security of our scheme in the random oracle model under the assumption that ECDLP is hard.

An improved discrete logarithm‐based multisignature scheme

ABSTRACTMany researchers have investigated the Rivest, Shamir, and Adleman (RSA) and ElGamal algorithms for digital multisignatures. Computational and communicational costs increase rapidly after a series of signings; these methods are unsuitable for organizations with multiple geographic locations. Because these methods require many online tasks, problems such as theft, data falsification, and masquerading often occur. This study therefore proposes a digital multisignature scheme that decreases computational costs and achieves quick validation. Copyright © 2011 John Wiley & Sons, Ltd.

Contract signature in e-commerce

In this paper, we propose a notion of contract signature used in e-commerce applications. We propose a contract signature scheme based on the discrete logarithm assumption. The contract signature scheme adopts a digital multi-signature scheme in public-key cryptography to facilitate fair signature exchange over network. This proposed solution allows multiple signers of a contract signature to exchange their partial signatures which are fully ambiguous for any third party (i.e., 1 out of ∞ ambiguity) to construct a valid contract signature. In case any signer releases the partial signature to others, the signer does not bind to the contract.

Attack and improvement of Zhang’s multi-signature scheme

After analyzing the ID-based digital multi-signature scheme based on RSA ( Rivest-Shamir-Adleman) proposed by Zhang et al. in 2008, a complete attack algorithm was proposed. Firstly, Zhang et al. 's scheme and the attack algorithm were introduced, and then two improved schemes against to the security problem of Zhang's scheme were proposed. The random operation of each signer was changed, and part of computation operation was transferred in both of the improved schemes. The results show that the improved schemes are secure without decreasing the efficiency of signing and verifying. Therefore, the improved schemes are more valuable in practical application.

Digital Multi-Signature Scheme and Its Security Proof

A new sequential digital multi-signature scheme and a new broadcasting digital multi-signature scheme are proposed based on the difficulty assumption of factoring and quadratic residues.The advantages of the proposed schemes are as follows:the multi-signature is a co-signature which is generated by multiple signers in collaborative and simultaneous manner,in which,per signer generates partly signature,rather than accumulating per signer's single signature.The length of the partly signatures does not grow with the number of the signers.The computation complicacy of the partly signature algorithm and the verification algorithm is independent of the signer's number.The signing sequence of the proposed sequential digital multi-signature scheme is fixed and unable to be changed freely by the signers.Proposed schemes have lower computation complicacy and more efficient,and are secure against existent attacks for multi-signature schemes.Their securities are proved under the difficulty assumption of factoring and quadratic residues in the random oracle model.

REALIZABLE QUANTUM BROADCASTING MULTI-SIGNATURE SCHEME

Two quantum broadcasting multi-signature schemes are presented: one is used to sign classical digital messages and the other to sign quantum messages. The quantum one-way function is used to realize signature and verification in the digital multi-signature scheme, while quantum teleportation is used in the quantum multi-signature scheme. The proposed schemes support infinite amounts of signatories and provide a novel and experimentally feasible method to construct multi-signature quantum signature systems within current technology.

Digital multisignature on the generalized conic curve over Z n

This paper proposes a digital multi-signature scheme on the generalized conic curve over Z n . The generalized conic curve R n ( a, b, c) over residue class ring Z n and its group structure are presented. The paper gives the representation of the order and base point on R n ( a, b, c), and introduces the representation of operation by parameters to simplify its calculation. The scheme security is based on the factoring and discrete logarithms simultaneously. This scheme is easy to accomplish for convenient embedding plaintext, computing element order and points in the conic curve. In addition, it can speed up the inverse operation and resist Pohlig–Hellman's attack and Wiener's attack.

Attack on Digital Multi-Signature Scheme Based on Elliptic Curve Cryptosystem

The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a "false" public key to a "true" one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.

Digital multi-signature scheme based on the Elliptic Curve cryptosystem

In the study, the digital multi-signature scheme, constructed by the integration of one-way hash function and identification scheme, are proposed based on the elliptic curve cryptosystem (ECC). To ...

ID기반 디지털 다중 서명 기술을 적용한 안전한 이동 에이전트 시스템의 설계

이동에이전트 시스템은 기하급수적으로 증가하는 분산처리 환경과 이동컴퓨팅에 기여할 수 있다는 점으로 인해 주목받고 있는 기술이지만, 심각한 보안문제를 안고 있다. 본 연구는 이동 에이전트 시스템이 가질 수 있는 보안 공격을 NIST 문서에 기초하여 분석하였다. 이들 공격으로부터 이동 에이전트 시스템을 보호하기 위해서 ID에 기반한 키(key) 분배 기법과 디지털 다중 서명(Digital Multi-signature)기법을 이용하여 이동 에이전트 시스템을 위한 보안 프로토콜을 제안한다. NIST에서 제안한 이들 문제를 해결하기 위해서는 이동 에이전트 보안과 에이전트 플랫폼 보안을 수행하여야 한다. 기존 프로토콜은 둘 중의 하나만을 언급한 반면에, 제안된 프로토콜은 이들 두 가지 측면 모두에서 보안을 만족시키고자 하였다. 제안된 프로토콜은 1)키 관리의 단순화, 2)보안 서비스 만족(기밀성, 무결성, 인증, 부인방지), 3)생명성 보장, 4)실행결과데이터 보호, 5)제전송공격방지 등의 보안 특성을 만족시킨다. 또한 에이전트 실행의 각 단계를 매 시스템마다 검증함으로써 메시지의 변경 시에 곧바로 탐지한다. Mobile agent system comes into the spotlight since it contributes largely to mobile computing on distributed network environment. However, this system has a number of significant security Problems. In this Paper, we analyze suity attacks to mobile agent system Presented by NIST[3]. In order to protect this system from them, we suggest a security protocol for mobile agent system by employing R based key distribution and digital multi-signature scheme. To solve these problems described in NIST, securities for mobile agent and agent platform shouid be accomplished. Comparing with other protocols, our protocol performs both of these securities, while other protocols mentioned only one of them. Proposed Protocol satisfies simplicity of key management, providing security service such as confidentiality, integrity, authentication and preventing reputation, liveness guarantee, protection of excution-result data and preventing replay attack. Furthermore, it is designed to detect message modification immediately by verifying each step of agent execution at a corresponding server.

ElGamal-like digital signature and multisignature schemes using self-certified public keys

In this paper, we first present a digital signature scheme using self-certified public key. Subsequently, we present a digital multisignature scheme extended from the proposed digital signature. Both the proposed schemes have the advantage that the authentication of the public key can be accomplished with the verification of the signature or multisignature. The security of both the proposed schemes is based on the one-way hash function, the factorization and the discrete logarithm assumptions. Moreover, the proposed multisignature scheme preserves the main merits inherent in most of the previously developed schemes. We also demonstrate that the proposed multisignature scheme can withstand the active attack that some malicious impostors try to universally forge an individual signature or a multisignature for a given message that is rejected to be signed by the other co-signers.

Comment: Cryptanalysis of Harn digital multisignature scheme with distinguished signing authorities

Comment: Cryptanalysis of Harn digital multisignature scheme with distinguished signing authorities

ID-BASED DIGITAL MULTISIGNATURE SCHEME

By introducing identity-based cryptosystem into the digital multisignature, we propose a new ID-based digital multisignature scheme in this paper, which allows a user to communicate with others by knowing only the identity of his communication partner and the public key of the KAC, and provides an efficient multisignature without any data expansion. Its security is also analyzed.

Group-oriented (t, n) threshold digital signature scheme and digital multisignature

The paper presents group-oriented (t,n) threshold digital signature schemes based on the difficulty of solving the discrete logarithm problem. By employing these schemes, any t out of n users in a group can represent this group to sign the group signature. The size of the group signature and the verification time of the group signature are equivalent to that of an individual digital signature. In other words, the (t, n) threshold signature scheme has the following five properties: (i) any group signature is mutually generated by at least t group members; (ii) the size of the group signature is equivalent to the size of an individual signature; (iii) the signature verification process is simplified because there is only one group public key required; (iv) the group signature can be verified by any outsider; and (v) the group holds the responsibility to the signed message. In addition to the above properties, two of the schemes proposed do not require the assistance of a mutually trusted party. Each member selects its own secret key and the group public key is determined by all group members. Each group member signs a message separately and sends the individual signature to a designated clerk. The clerk validates each individual signature and then combines all individual signatures into a group signature. The (n, n) threshold signature scheme can be easily extended to become a digital multisignature scheme.< >

A digital multisignature scheme using bijective public-key cryptosystems

A new digital multisignature scheme using bijective public-key cryptosystems that overcomes the problems of previous signature schemes used for multisignatures is proposed. The principal features of this scheme are (1) the length of a multisignature message is nearly equivalent to that for a singlesignature message; (2) by using a one-way hash function, multisignature generation and verification are processed in an efficient manner; (3) the order of signing is not restricted; and (4) this scheme can be constructed on any bijective public-key cryptosystem as well as the RSA scheme. In addition, it is shown that the new scheme is considered as safe as the public-key cryptosystem used in this new scheme. Some variations based on the scheme are also presented.