摘要:

Chen et al.~introduced a new notion of a concurrent signature scheme for a fair exchange of signatures with two parties. Chen et al. also proposed a concrete scheme and proved its security under the assumption of discrete logarithm problem. Recently, Hiwatari and Tanaka extended the concept of concurrent signature to many-to-one setting. Hiwatari and Tanaka also proposed a concrete scheme; however, it requires some strong assumption to achieve the fair exchange and it is not efficient. This paper gives another construction of concurrent signature for many-to-one setting with multisignature scheme. Hereafter, we call it (n,1) concurrent signature scheme. The proposed scheme is more efficient than the scheme of Hiwatari and Tanaka in computation complexity and signature size, and achieves the fair exchange without the assumption required for the scheme of Hiwatari and Tanaka. This paper also gives a construction for the fair exchange of signatures in many-to-many setting, called $(n,m)$ concurrent signature scheme, in appendix.

展开

signature=ec663bb1ca3cfa2e278da44aa044d1c6,Fair Exchange of Signatures with Multiple Signers相关推荐

  1. signature=41e736b92e1544d0f102fb31e51398eb,Fair e-payment protocol based on blind signature

    摘要: Electronic transaction through e-payment protocol will grow tremendous in the coming years. In t ...

  2. State and Progress in Strand Spaces-Proving Fair Exchange 的研读

  3. Android P v3签名新特性

    新版v3签名在v2的基础上,仍然采用检查整个压缩包的校验方式.不同的是在签名部分增可以添加新的证书,即可以不用修改ApplicationID来完成证书的更新迭代. 本文引用自 https://xuan ...

  4. signature=de15a75f36f4ab4d3249c21fbaa05791,1-out-of-n Signatures from a Variety of Keys

    摘要: This paper addresses how to use public-keys of several different signature schemes to generate 1 ...

  5. signature=c4f11bb5142d9f6ce0876b3cc0d888af,PROVISIONAL SIGNATURE SCHEMES

    PRIORITY This is a divisional of application Ser. No. 11/215,550, filed on Aug. 29, 2005, entitled & ...

  6. C#LeetCode刷题之#888-公平的糖果交换(Fair Candy Swap)

    问题 该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3758 访问. 爱丽丝和鲍勃有不同大小的糖果棒:A[i] 是爱丽丝 ...

  7. nvidia Multiple Process Service (MPS)

    What MPS is? MPS is a binary-compatible client-server runtime implementation of the CUDA API which c ...

  8. deconstructSigs|探寻cosmic的独特“气质”-mutation signature !

    deconstructSigs-mutation signature看一下你的数据是什么"气质"的? 本文首发于"生信补给站" https://mp.weixi ...

  9. 用deconstructSigs来做cosmic的mutation signature图

    用deconstructSigs来做cosmic的mutation signature图 作者的英文文档对这个包的用法描述的非常清楚, 我只是记录一下自己学习该包用法的一点感悟. 安装并加载必须的pa ...

最新文章

  1. 你见过最差的算法工程师都有哪些表现?
  2. Codeforces Gym 100513G G. FacePalm Accounting 暴力
  3. 在一个数组中实现两个堆栈
  4. 什么限制了GNN的能力?首篇探究GNN普适性与局限性的论文出炉
  5. java基础相关知识
  6. java居中的命令_用JAVA把语句排列成左对齐、右对齐、居中
  7. ERROR: cannot launch node of type [turtlebot_teleop/turtlebot_teleop_key] 问题解决
  8. 高糊马赛克秒变高清,表情帝:这还是我吗?
  9. matlab中get和set命令,关于matlab中get和set的用法
  10. 递归求解全排列问题以及八皇后问题
  11. sql 存储过程分页
  12. Java新职篇:类型提升的约定
  13. 明明选的是个人用途,为什么会被检测商用?
  14. oracle函数,查询,事务
  15. [nssl 1322][jzoj cz 2109] 清兵线 {dp}
  16. 怎样在matlab中使用多项式,MATLAB中的多项式运算
  17. 揭秘大家都在用的报表——帆软报表,专为数据分析而生!
  18. 详解 git cherry-pick用法
  19. discuz_result
  20. android怎么添加地铁卡,安卓手机公交卡怎么刷

热门文章

  1. Fast Image Cache – iOS 应用程序高性能图片缓存
  2. C# 设置当前程序调用的dll文件以及其他文件的寻址路径
  3. JS获取当前对象大小以及屏幕分辨率等
  4. Lockdown Wheelie项目
  5. leetcode 1449. 数位成本和为目标值的最大数字(dp)
  6. leetcode1302. 层数最深叶子节点的和(深度优先搜索)
  7. web后端开发学习路线_学习后端Web开发的最佳方法
  8. 前端初学者开发学习视频_初学者学习前端开发的实用指南
  9. 速度与激情的Webpack
  10. 递归javascript_JavaScript中的递归