i and the one-time public key i. Besides, in collaboration of participant devices included in the set S, the one-time public key i (iT'-S) included in a set (T'-S) is produced. A one-time public key i (iN-T') included in a set (N-T') is determined by calculation using a polynomial expression of t'-th order determined from i (iT'). After producing the one-time public key, the signature is made.;COPYRIGHT: (C)2007,JPO&INPIT"/> Electronic signature method with threshold, verification method, electronic signature system, verification device, signature device, duplicate signature copy signature detection device, signature verification system, signature verification method, electronic billing system, electronic cash payment system, and program
首页> 外国专利> Electronic signature method with threshold, verification method, electronic signature system, verification device, signature device, duplicate signature copy signature detection device, signature verification system, signature verification method, electronic billing system, electronic cash payment system, and program

Electronic signature method with threshold, verification method, electronic signature system, verification device, signature device, duplicate signature copy signature detection device, signature verification system, signature verification method, electronic billing system, electronic cash payment system, and program

机译:具有阈值的电子签名方法,验证方法,电子签名系统,验证设备,签名设备,重复签名副本签名检测设备,签名验证系统,签名验证方法,电子计费系统,电子现金支付系统和程序

摘要

PROBLEM TO BE SOLVED: To provide a signature method to confirm that the number of participant devices which signs on is not less than t (a set T) and is not more than t' (a set T') when s units of the participant device (a set S) included in n units of the participant device (an aggregate N) sign on.;SOLUTION: A one-time public key and a public key are associated with each other by equalizing discrete logarithms of the one-time public key and public key of a signatory based on an origin whose discrete logarithm problem is unclear. In each of participant devices that signs on and are included in the set S, a one-time public key i (iS) {note: "" denotes that i is an element of the set S and hereinafter the same} is produced so as to equalize the discrete logarithms between public key yi and the one-time public key i. Besides, in collaboration of participant devices included in the set S, the one-time public key i (iT'-S) included in a set (T'-S) is produced. A one-time public key i (iN-T') included in a set (N-T') is determined by calculation using a polynomial expression of t'-th order determined from i (iT'). After producing the one-time public key, the signature is made.;COPYRIGHT: (C)2007,JPO&INPIT
机译:解决的问题:提供一种签名方法,以确认以s个参与者为单位时,已签名的参与者设备的数量不少于t(集合T)且不超过t'(集合T')。参与者设备的n个单位中包含的一个设备(集合S)(总计N个)登录。解决方案:一次性公钥和公钥通过均衡一次公有设备的离散对数相互关联基于不清楚离散对数问题的原点的签名人的密钥和公钥。在每个登录并包含在集合S中的参与者设备中,一次性公共密钥 i (iS){注:“”表示i是集合S的元素,此后为了使公钥y i 和一次性公钥 i 之间的离散对数相等,产生了相同的}。此外,在集合S中包括的参与者设备的协作下,产生了集合(T'-S)中包括的一次性公共密钥 i (iT'-S)。通过使用从 i确定的第t'阶多项式表达式进行计算,确定集合(N-T')中包含的一次性公钥 i (iN-T') (iT')。产生一次性公钥后,进行签名。;版权所有:(C)2007,JPO&INPIT

著录项

  • 公开/公告号JP4790422B2

    专利类型

  • 公开/公告日2011-10-12

    原文格式PDF

  • 申请/专利权人 日本電信電話株式会社;

    申请/专利号JP20060008040

  • 发明设计人 鈴木 幸太郎;藤崎 英一郎;

    申请日2006-01-16

  • 分类号H04L9/32;G09C1;

  • 国家 JP

  • 入库时间 2022-08-21 18:23:30

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号