earticle

논문검색

Research and Improvement of Ordered Multisignature Algorithm in Random Oracle Model

원문정보

초록

영어

Ordered multisignature allows signers attest to a common message as well as the order in whey they signed. Unlike multi-signature, aggregate signature aggregate signature scheme provides a method to aggregate signature by signature on different messages. In this paper, we presented an ordered multisignature provably secure without random oracles. We mainly focus on construction of perfectly hiding and computationally binding commitment (PHCBC). Our construction was based on the signature scheme of waters and is computationally suitable for practical application. Experiment showed that this scheme was suitable for the practical application with high computing efficiency. By transmitting individual signatures into a multi-signature, multi-signature scheme can greatly save communication cost.

목차

Abstract
 1. Introduction
 2. Digital Signature Schemes and Security Model
  2.1. Digital Signature Schemes
  2.2. Security Model
 3. Waters Signature Scheme and Ordered Multisignature Schemes
  3.1. Bilinear Maps
  3.2. The Waters Signature Scheme
  3.3. Ordered Multisignature Schemes and their Security
 4. The Proposed Scheme
 5. The Security Proof
 6. Conclusions
 References

저자정보

  • Yonglong Tang School of mathematics and Statistics Jishou University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.