公开(公告)号：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.

公开(公告)号：US07974405B2

公开(公告)日：2011-07-05

申请号：US10587308

申请日：2005-01-26

申请人： Jun Furukawa ,  Isamu Teranishi

发明人： Jun Furukawa ,  Isamu Teranishi

IPC分类号： G06F15/16 ,  H04L9/00 ,  H04L9/28

CPC分类号： H04L9/00 ,  H04L9/3013

摘要： In an input process, a circuit and an input bit to the circuit are inputted to a plurality of computers. Firstly, one computer performs calculation and transmits the calculation result to another computer of the computers. Next, the another computer which has received the calculation result performs the next calculation. Thus, calculation is performed by one computer after another. When all the computers have performed calculation once, the last computer which has performed calculation transmits the calculation result to the first computer which has performed calculation. After this, calculation is performed by one computer after another and the calculation result is transmitted to the next computer, thereby repeating the calculation of each cycle. Thus, it is possible to realize calculation of a value of a given function by using a device including a plurality of computers, with a simpler configuration.

摘要翻译： 在输入处理中，电路和电路的输入位被输入到多个计算机。 首先，一台计算机执行计算，并将计算结果发送到计算机的另一台计算机。 接下来，接收到计算结果的另一计算机进行下一次计算。 因此，计算由一台计算机执行。 当所有计算机执行计算一次时，执行计算的最后一台计算机将计算结果发送到已执行计算的第一台计算机。 之后，一台计算机执行计算，并将计算结果发送到下一台计算机，从而重复每个周期的计算。 因此，可以通过使用具有更简单的结构的包括多个计算机的装置来实现给定功能的值的计算。

公开(公告)号：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签名是安全的方法相同的方法中具有可提取性的特征。

公开(公告)号：US09460315B2

公开(公告)日：2016-10-04

申请号：US14117801

申请日：2012-05-17

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/06 ,  G06F21/72 ,  G06F21/62 ,  H04L9/28 ,  H04L9/30

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来生成密文 根据与比特长度匹配的分布，随机选择确定。

公开(公告)号：US09300471B2

公开(公告)日：2016-03-29

申请号：US14131404

申请日：2012-07-06

申请人： Toshinori Araki ,  Isamu Teranishi ,  Jun Furukawa

发明人： Toshinori Araki ,  Isamu Teranishi ,  Jun Furukawa

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

CPC分类号： H04L9/3242 ,  G06F17/30625 ,  G06F21/62

摘要： An information processing apparatus includes: a storage unit that stores a tree structure formed by nodes, each of which is stores identification information identifying a document; and a registration unit that registers documents in the storage unit. The registration unit receives a document including identification information identifying the document and a word set and a key, registers the identification information in a leaf node in the tree structure, and calculates a secure index corresponding to identification information registered in each node from a root node to the leaf node in the tree structure based on the word set and the key. In addition, the registration unit generates a value calculated by adding the calculated secure index as a search index for the document and stores a value calculated by adding a search index generated for each of a plurality of received documents as a search index for the plurality of documents in the storage unit.

摘要翻译： 一种信息处理设备，包括：存储单元，存储由节点形成的树结构，每个节点存储识别文档的标识信息; 以及注册单元，其将文档注册到存储单元中。 注册单元接收包括识别文档和单词集合和密钥的识别信息的文档，将该识别信息登记在树结构中的叶节点中，并从根节点计算与登记在每个节点中的识别信息相对应的安全索引 在树结构中的叶节点基于字集和密钥。 此外，注册单元生成通过将计算出的安全索引作为文档的搜索索引相加而计算出的值，并且存储通过将针对多个接收文档中的每一个生成的搜索索引相加而计算的值作为多个 存储单元中的文档。

公开(公告)号：US20140129567A1

公开(公告)日：2014-05-08

申请号：US14233662

申请日：2012-07-27

申请人： Toshinori Araki ,  Isamu Teranishi

发明人： Toshinori Araki ,  Isamu Teranishi

IPC分类号： G06F17/30

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.

摘要翻译： 在本发明中，可以在具有加密注册信息的数据库中有效地执行范围搜索。 多个值，用于识别多个值的第一识别信息和键被接受为输入。 从多个值生成值组。 将值组视为单词组，并从单词组，第一个标识信息和关键字生成安全索引。 基于要检索的值和密钥，生成要检索的值的陷门信息。 对于所生成的安全索引，使用陷门信息执行安全索引评估处理。 当作为评估过程的结果将要检索的值评估为包含在安全索引中时，输出用于识别安全索引的第二识别信息。

公开(公告)号：US20110246779A1

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

申请号：US13133110

申请日：2009-12-09

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/32

CPC分类号： H04L9/3236 ,  H04L9/3013 ,  H04L9/3218 ,  H04L67/04 ,  H04L2209/463 ,  H04L2209/80 ,  H04W12/06

摘要： Provided is a zero-knowledge proof system that allows a discrete-logarithm zero-knowledge proof. The zero-knowledge proof device includes a temporary memory unit that stores pseudorandom numbers and previously determined hash values, a first processing unit that calculates multiple pseudorandom numbers and performs multiple iterations of processing to calculate hash values based on the calculated pseudorandom numbers and the information stored in the temporary memory unit, a second processing unit that determines some of the multiple pseudorandom numbers based on the hash values, and a third processing unit that re-calculates some of the pseudorandom numbers and sends the hash values obtained to a zero-knowledge verification device. The zero-knowledge verification device includes a temporary memory region, a data receiving module that sequentially receives new input data, and a processing module that overwrites hash values including variables and input data, as variables into the temporary memory region each time the input data are received.

摘要翻译： 提供了一种零知识证明系统，允许离散对数零知识证明。 零知识证明装置包括存储伪随机数和预先确定的散列值的临时存储单元，第一处理单元，其计算多个伪随机数并执行多次迭代处理以基于所计算的伪随机数和存储的信息来计算哈希值 在临时存储器单元中，第二处理单元，其基于散列值确定多个伪随机数中的一些;以及第三处理单元，其重新计算一些伪随机数，并将获得的哈希值发送到零知识验证 设备。 零知识验证装置包括临时存储器区域，顺序地接收新的输入数据的数据接收模块，以及每当输入数据是时，将包括变量和输入数据的散列值作为变量重写到临时存储区域中的处理模块 收到了

公开(公告)号：US08028171B2

公开(公告)日：2011-09-27

申请号：US11795616

申请日：2005-12-13

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/32

CPC分类号： H04L9/3013 ,  H04L9/3218 ,  H04L9/3247

摘要： Provided are a signature apparatus, a verifying apparatus, a proving apparatus, an encrypting apparatus, and a decrypting apparatus capable of efficiently reducing a signature text counterfeit problem to a discrete logarithm problem. The commitment is a hash value of a set of a value to be committed. Data including a pair of elements of a cyclic group associated with a discrete logarithm problem is used as a public key, and a discrete logarithm of an order of the pair is used as a secret key. Accordingly, it is possible to summarize secret information of an attacker from the commitment without rewinding the attacker and to ensure a higher safety than that of a Schnorr signature scheme. In addition, one-time power residue calculation is performed in each of the signature and verification calculations, so that it is possible to lower an amount of calculation in the signature and verification calculations.

摘要翻译： 提供能够有效地将签名文本假冒问题降低到离散对数问题的签名装置，验证装置，证明装置，加密装置和解密装置。 承诺是要提交的一组值的哈希值。 将包括与离散对数问题相关联的循环组的一对元素的数据用作公钥，并且将该对的顺序的离散对数用作秘密密钥。 因此，可以从承诺总结攻击者的秘密信息，而不用重绕攻击者，并确保比Schnorr签名方案更高的安全性。 此外，在每个签名和验证计算中执行一次功率余量计算，使得可以降低签名和验证计算中的计算量。

公开(公告)号：US20090276630A1

公开(公告)日：2009-11-05

申请号：US12225124

申请日：2007-03-14

申请人： Isamu Teranishi

发明人： Isamu Teranishi

IPC分类号： H04L9/32 ,  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的主要e'上获得消息，属 使用B值，用户设备公钥，用户设备秘密密钥和消息的消息的签名语句，并将该消息的签名语句发送到验证设备500。