公开(公告)号：US09690845B2

公开(公告)日：2017-06-27

申请号：US14233662

申请日：2012-07-27

申请人： Toshinori Araki ,  Isamu Teranishi

发明人： Toshinori Araki ,  Isamu Teranishi

IPC分类号： G06F17/30 ,  G06F7/00 ,  H04L9/30 ,  G06F21/62

CPC分类号： G06F17/30622 ,  G06F17/30946 ,  G06F21/6218 ,  H04L9/30

摘要： In the present invention, scope search can be effectively performed in a database having encrypted registration information. A plurality of values, first identification information to identify the plurality of values, and a key are accepted as input. A value group is generated from the plurality of values. The value group is treated as a word group, and a secure index is generated from the word group, the first identification information, and the key. On the basis of a value to be retrieved and a key, trapdoor information for the value to be retrieved is generated. With respect to the generated secure index, a secure index assessment process is performed using the trapdoor information. When the value to be retrieved is assessed to be contained in the secure index as a result of the assessment process, second identification information to identify the secure index is output.

公开(公告)号：US20090041239A1

公开(公告)日：2009-02-12

申请号：US11915561

申请日：2006-05-26

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/06

CPC分类号： H04L9/0656 ,  H04L9/3218

摘要： An efficient pseudo-random function and an efficient limited number of times authentication system using such a function are realized. A pseudo-random function calculating device comprises a key creating means and a pseudo-random function calculating means. The key creating means creates a public key made of a set of at least a first component and a second component as components constituting an element of a finite group and a secret key made of an integer and secretly saves the created secret key in a secret key memory section but makes the public key public. The pseudo-random function calculating means outputs the element of a finite group as function value of the pseudo-random function upon receiving an integer as input. The pseudo-random function calculating means outputs the product of multiplication of the first element of the value obtained by calculating the modular exponentiation, using the first component of the public key and the input integer respectively as base and exponent, and the second element of the value obtained by calculating the modular exponentiation, using the second component of the public key and the reciprocal of the sum of the secret key and the input integer in a finite field respectively as base and component.

摘要翻译： 实现了使用这种功能的有效的伪随机函数和有效的有限次认证系统。 伪随机函数计算装置包括密钥创建装置和伪随机函数计算装置。 密钥创建装置创建由至少第一组件和第二组件组成的公钥作为构成有限组的元素的组件和由整数组成的秘密密钥，并将创建的秘密密钥秘密地保存在秘密密钥中 记忆部分，但使公共密钥公开。 伪随机函数计算装置在接收到整数作为输入时，输出有限群的元素作为伪随机函数的函数值。 伪随机函数计算装置输出通过使用公钥的第一分量和输入的整数分别作为基数和指数来计算获得的值的第一元素的相乘乘积，以及第二元素的乘积 通过使用公钥的第二分量和有限域中的秘密密钥和输入整数的和的倒数作为基础和分量来计算获得的幂数值。

公开(公告)号：US20080152130A1

公开(公告)日：2008-06-26

申请号：US11795267

申请日：2005-12-13

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/30

CPC分类号： H04L9/3013 ,  H04L9/302 ,  H04L9/3255 ,  H04L2209/42

摘要： An efficient and safe group signature scheme is provided. According to the present invention, an open unit is provided to not an issuer but an opener, and a data required for operating the open unit does not include a key pair of the issuer, so that it is possible to accurately operate the open unit even if the issuer generates the public key in an illegal manner. In addition, it is possible to prove that a key pair of a member cannot be counterfeited. It is possible to implement from a discrete logarithm assumption a feature that a cipher text, that is, a portion of a signature text can be decrypted only by the opener in a method which is the same as a method representing that an ElGamal crypto scheme is safe. In addition, it is possible to implement from a random oracle assumption a feature that a knowledge signature has an extractability in a method which is the same as a method proving that a Schnorr signature is safe.

摘要翻译： 提供了一种高效安全的组签名方案。 根据本发明，开放单元不提供给发行者而是开放者，并且操作开放单元所需的数据不包括发行人的密钥对，使得可以准确地操作开放单元 如果发行人以非法方式生成公钥。 另外，可以证明成员的一对密钥不能被伪造。 可以从离散对数假设实现一个特征，即密文即签名文本的一部分只能由开启者解密，方法与表示ElGamal密码方案的方法相同 安全。 另外，可以从随机oracle假设实现知识签名在与证明Schnorr签名是安全的方法相同的方法中具有可提取性的特征。

公开(公告)号：US08356182B2

公开(公告)日：2013-01-15

申请号：US12439591

申请日：2007-04-13

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L29/06 ,  H04L9/30 ,  H04L9/32

CPC分类号： H04L9/0877 ,  H04L9/3247

摘要： A key creating device creates a first public key and a first secret key of the electronic signature method satisfying the noncounterfeitability and a second public key and the first secret key of the chameleon commitment method. The signature device generates a commitment, a first random number according to the Com algorithm, and a first signature by using the first secret key. The signature device further generates a second random number according to the Cam algorithm by using the message written by adding a first signature to an object message, and creates an electronic signature by combining the first signature and the second random number. A verifying device receives the signed message written by adding the first signature included in the electronic signature to the object message, creates a commitment according to the ComVer algorithm, and performs verification by using the commitment and the first signature.

摘要翻译： 密钥创建设备创建满足不可否认性的电子签名方法的第一公钥和第一秘密密钥，以及变色龙承诺方法的第二公钥和第一秘密密钥。 签名装置根据Com算法生成承诺，第一随机数和使用第一秘密密钥的第一签名。 签名装置还通过使用通过对对象消息添加第一签名而写入的消息，根据凸轮算法生成第二随机数，并通过组合第一签名和第二随机数来创建电子签名。 验证装置通过将包括在电子签名中的第一签名添加到对象消息中来接收签名消息，根据ComVer算法创建承诺，并通过使用承诺和第一签名进行验证。

公开(公告)号：US08041944B2

公开(公告)日：2011-10-18

申请号：US12225124

申请日：2007-03-14

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/08

CPC分类号： H04L9/0891 ,  H04L9/3033 ,  H04L9/3255 ,  H04L2209/42 ,  H04L2209/463

摘要： In a group signature system of the present invention, user device 400 registered in the group, when receiving an issuing device public key of a set that includes order N of a cyclic group and its elements a—0, a—1 and a—2, determines such primes e and e′ that e′ is a prime that is obtained by subtracting a fixed number smaller than the prime e from the prime e, generates a user device secret key of a set including such numbers x and r that the product between a—0 and the result obtained by performing modular exponentiation of a—1 by number x, multiplied by the result obtained by performing modular exponentiation of a—2 by number r is equal to the result obtained by performing element A of the first cyclic group raised to the e-th power, based on order N as a modulus, and a user device public key of a set including prime e, prime e′ and element A, transmits prime e′ to revocation manager 300, receives B calculated based on prime e′ from revocation manager 300 to obtain a message, generates a signature statement for the message using the B value, the user device public key, the user device secret key and the message, and transmits the signature statement with the message and to verifying device 500.

摘要翻译： 在本发明的组签名系统中，当接收到包括循环组的次序N的集合的发行装置公钥及其元素a-0，a-1和a-2时，登记在组中的用户装置400 确定这样的素数e和e'，e'是通过从素数e减去小于素数e的固定数而获得的素数，生成包括这样的数字x和r的集合的用户设备秘密密钥，即产品 在a-0和通过执行a-1乘数x的模幂获得的结果乘以通过执行a-2乘数r的模幂获得的结果等于通过执行第一循环的元素A获得的结果 基于订单N作为模数，并且包括素数e，素数e'和元素A的集合的用户设备公钥被发起到e次幂，将素数e'发送到撤销管理器300，接收基于计算的B 从撤销经理300到ob 留下消息，使用B值，用户设备公钥，用户设备秘密密钥和消息生成消息的签名语句，并将该消息的签名语句发送到验证设备500。

公开(公告)号：US08949609B2

公开(公告)日：2015-02-03

申请号：US13383476

申请日：2010-07-06

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/30 ,  H04L9/32

CPC分类号： H04L9/3218 ,  H04L9/3249

摘要： The user device includes: a recording unit which stores system parameters as respective parameters given in advance, a disclosure public key, a user public key, a user private key, a member certificate, and an attribute certificate; an input/output unit which receives input of the document from the user and an attribute the user intends to disclose; a cryptograph generating module which generates a cryptograph based on the inputted document, the attribute to be disclosed, and each of the parameters; a signature text generating module which generates a zero-knowledge signature text from the generated cryptograph; and a signature output module which outputs the cryptograph and the zero-knowledge signature text as the signature data. The user public key and the attribute certificate are generated by using a same power.

摘要翻译： 用户装置包括：记录单元，其将系统参数存储为预先给出的各个参数，公开公钥，用户公钥，用户专用密钥，成员证书和属性证书; 从用户接收文档的输入的输入/输出单元和用户想要公开的属性; 密码生成模块，其基于输入的文档生成密码，要公开的属性以及每个参数; 签名文本生成模块，其从所生成的密码生成零知识签名文本; 以及签名输出模块，其输出密码和零知识签名文本作为签名数据。 用户公钥和属性证书是通过使用相同的权力生成的。

公开(公告)号：US20140089678A1

公开(公告)日：2014-03-27

申请号：US14117801

申请日：2012-05-17

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： G06F21/72

CPC分类号： G06F21/72 ,  G06F21/6227 ,  H04L9/0618 ,  H04L9/0662 ,  H04L9/30

摘要： An order-preserving encryption system has an encryption means which generates a ciphertext as a sum of data which complies with a distribution X determined in advance, and the encryption means generates the ciphertext using the distribution X represented in a format that data of a bit length determined at random is selected at random according to a distribution matching the bit length.

摘要翻译： 订单保存加密系统具有加密装置，其生成符合预先确定的分发X的数据的和的密文，并且加密装置使用以比特长度的数据格式表示的分布X来生成密文 根据与比特长度匹配的分布，随机选择确定。

公开(公告)号：US20120124379A1

公开(公告)日：2012-05-17

申请号：US13383476

申请日：2010-07-06

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/30

CPC分类号： H04L9/3218 ,  H04L9/3249

摘要： The user device includes: a recording unit which stores system parameters as respective parameters given in advance, a disclosure public key, a user public key, a user private key, a member certificate, and an attribute certificate; an input/output unit which receives input of the document from the user and an attribute the user intends to disclose; a cryptograph generating module which generates a cryptograph based on the inputted document, the attribute to be disclosed, and each of the parameters; a signature text generating module which generates a zero-knowledge signature text from the generated cryptograph; and a signature output module which outputs the cryptograph and the zero-knowledge signature text as the signature data. The user public key and the attribute certificate are generated by using a same power.

摘要翻译： 用户装置包括：记录单元，其将系统参数存储为预先给出的各个参数，公开公钥，用户公钥，用户专用密钥，成员证书和属性证书; 从用户接收文档的输入的输入/输出单元和用户想要公开的属性; 密码生成模块，其基于输入的文档生成密码，要公开的属性以及每个参数; 签名文本生成模块，其从所生成的密码生成零知识签名文本; 以及签名输出模块，其输出密码和零知识签名文本作为签名数据。 用户公钥和属性证书是通过使用相同的权力生成的。

公开(公告)号：US20100169643A1

公开(公告)日：2010-07-01

申请号：US12278874

申请日：2007-02-06

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/32 ,  G06F17/10

CPC分类号： H04L9/3236 ,  H04L9/3218 ,  H04L9/3271

摘要： The proof verification system of the present invention is composed of a proving device (100) and a verifying device (200). The proving device (100) holds m items of n items of secret data, and finds a plurality of Commit values from a portion of the plurality of elements of a cyclic group to transmit to the verifying device. Upon receiving a Challenge value c from the verifying device, the proving device generates remaining elements of a plurality of elements of the cyclic group, calculates a plurality of response values from the result, and transmits the plurality of elements of the cyclic group and the plurality of response values. The verifying device (200), upon receiving the plurality of Commit values from the proving device, transmits to the proving device a Challenge value c that is chosen from a plurality of random numbers, and upon receiving the plurality of elements of the cyclic group and the plurality of response values from the proving device, verifies the validity of the plurality of elements of the cyclic group, and if proper, verifies whether the proof statement resulting from the set (Commit value, Challenge value, response value) is valid or not.

摘要翻译： 本发明的证明验证系统由验证装置（100）和验证装置（200）组成。 证明装置（100）保存n个秘密数据的m个项目，并且从循环组的多个要素的一部分中找到多个提交值，以发送给验证装置。 在从验证装置接收到挑战值c的情况下，证明装置生成循环组的多个要素的剩余元素，从结果计算出多个响应值，并发送循环组和多个的多个元素 的响应值。 验证装置（200）在从证明装置接收到多个提交值时，向验证装置发送从多个随机数中选择的挑战值c，并且在接收到所述循环组的多个要素时， 来自证明设备的多个响应值验证循环组的多个元素的有效性，并且如果适当，则验证由设置（提交值，挑战值，响应值）产生的证明语句是否有效 。

公开(公告)号：US20090044017A1

公开(公告)日：2009-02-12

申请号：US11719798

申请日：2005-11-11

申请人： Isamu Teranishi ,  Kazue Sako ,  Daigo Taguchi ,  Jun Noda

发明人： Isamu Teranishi ,  Kazue Sako ,  Daigo Taguchi ,  Jun Noda

IPC分类号： H04L9/32 ,  G09C1/00

CPC分类号： H04L63/12 ,  H04L9/302 ,  H04L9/3249 ,  H04L63/123

摘要： An RSA signature method is provided in which the length of a signature does not depend on the number of signature devices when multiple signature devices are related to the creation of the signature. A signature device i_{m} includes first conversion means SS1B105 that performs no operation if a received signed text u_{i_{m−1}} exceeds a modulus n_{i_{m}} and, if not, adds an RSA-method-based signature; bijective conversion means S1B106 that multiplies the result by a function that maps the result to a value larger by the modulus n_{i_{m}}; second conversion means S1B107 that performs no operation if the operation result exceeds the modulus n_{i_{m}} and, if not, adds an RSA-method-based signature; and output means S1B109 that outputs the operation result as the signed text u_{i_{m}}.

摘要翻译： 提供了一种RSA签名方法，其中当多个签名设备与签名的创建相关时，签名的长度不依赖于签名设备的数量。 签名装置i_ {m}包括如果接收的签名文本u_ {i_ {m-1}}超过模数n_ {i_ {m}}而不执行操作的第一转换装置SS1B105，如果不是，则添加RSA方法 的签名 双重转换装置S1B106，其将结果乘以将结果映射到大于模数n_ {i_ {m}}的值的函数; 如果操作结果超过模数n_ {i_ {m}}，则不执行操作的第二转换装置S1B107，如果不是，则添加基于RSA方法的签名; 以及输出装置S1B109，其输出运算结果作为签名文本u_ {i_ {m}}。