Efficient Verifiably Encrypted Signature Scheme without Random Oracles
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This paper proposes an efficient verifiably encrypted signature scheme without random oracles. The scheme is constructed from the recent Gentry signature and can be rigorously proven to be secure in the standardmodel. The scheme has several advantages over previous systems such as, shorter public keys, lower computationoverhead, and a tighter security reduction, therefore, it is a truly practical verifiably encrypted signature withoutrandom oracles, which can be used in online contract signing protocols. Additionally, the proof of our scheme,which depends on the Strong Diffie-Hellman assumption, may be of independent interest.

    Reference
    Related
    Cited by
Get Citation

杨浩淼,孙世新,徐继友.一种无随机预言机的高效可验证加密签名方案.软件学报,2009,20(4):1069-1076

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 13,2007
  • Revised:February 04,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063