专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明申请

US20090044017A1 SIGNATURE AND VERIFYING METHOD, AND SIGNATURE AND VERIFYING DEVICE 审中-公开
标题翻译：签名和验证方法，签名和验证设备
公开(公告)号：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}}。

22. 发明授权

US09460315B2 Order-preserving encryption system, device, method, and program 有权
标题翻译：订单保存加密系统，设备，方法和程序
公开(公告)号：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来生成密文根据与比特长度匹配的分布，随机选择确定。

23. 发明申请

US20110246779A1 ZERO-KNOWLEDGE PROOF SYSTEM, ZERO-KNOWLEDGE PROOF DEVICE, ZERO-KNOWLEDGE VERIFICATION DEVICE, ZERO-KNOWLEDGE PROOF METHOD AND PROGRAM THEREFOR 审中-公开
标题翻译： ZERO-KNOWLEDGE PROOF SYSTEM，ZERO-KNOWLEDGE PROOF DEVICE，ZERO-KNOWLEDGE VERIFICATION DEVICE，ZERO-KNOWLEDGE PROOF METHOD AND PROGRAM THEREFOR
公开(公告)号：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.
摘要翻译：提供了一种零知识证明系统，允许离散对数零知识证明。零知识证明装置包括存储伪随机数和预先确定的散列值的临时存储单元，第一处理单元，其计算多个伪随机数并执行多次迭代处理以基于所计算的伪随机数和存储的信息来计算哈希值在临时存储器单元中，第二处理单元，其基于散列值确定多个伪随机数中的一些;以及第三处理单元，其重新计算一些伪随机数，并将获得的哈希值发送到零知识验证设备。零知识验证装置包括临时存储器区域，顺序地接收新的输入数据的数据接收模块，以及每当输入数据是时，将包括变量和输入数据的散列值作为变量重写到临时存储区域中的处理模块收到了

24. 发明授权

US08028171B2 Signature apparatus, verifying apparatus, proving apparatus, encrypting apparatus, and decrypting apparatus 有权
标题翻译：签名装置，验证装置，证明装置，加密装置和解密装置
公开(公告)号：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签名方案更高的安全性。此外，在每个签名和验证计算中执行一次功率余量计算，使得可以降低签名和验证计算中的计算量。

25. 发明申请

US20090276630A1 Group Signature System And Information Processing Method 有权
标题翻译：群体签名系统和信息处理方法
公开(公告)号：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。

26. 发明申请

US20090034716A1 TIME APPARATUS, ENCRYPTION APPARATUS, DECRYPTION APPARATUS, AND ENCRYPTION/DECRYPTION SYSTEM 审中-公开
标题翻译：时间设备，加密设备，分解设备和加密/分解系统
公开(公告)号：US20090034716A1
公开(公告)日：2009-02-05
申请号：US11996109
申请日：2006-07-21
申请人： Isamu Teranishi
发明人： Isamu Teranishi
IPC分类号： H04L9/28
CPC分类号： H04L9/3073 , H04L9/0847 , H04L2209/463
摘要： A time apparatus subjects a plurality of IDs to extract algorism. Each of the plurality of IDs is configured from a bit sequence, and the bit sequence is formed by expressing a current time instant as a bit sequence and concatenating a few bits from the first of the bit sequence. The time apparatus produces a plurality of decryption keys obtained as a result of subjecting the plurality of specified IDs to the extract algorism. An encryption apparatus specifies a plurality of IDs. Each of the plurality of IDs is configured from a bit sequence, the bit sequence being formed by expressing the designated time instant as a bit sequence and concatenating a few bits from the first of the bit sequence. The encryption apparatus reads the encryption key and the plurality of IDs supplied from the time apparatus to encrypt same plaintext. The encryption apparatus produces plural pieces of ciphertext. A decryption apparatus selects one decryption key from the inputted plurality of decryption keys, and selects one ciphertext from the inputted plural pieces of ciphertext. The decryption section decrypts the selected ciphertext using the selected decryption key on the basis of an ID based encryption method.
摘要翻译：时间装置使多个ID提取算法。多个ID中的每一个由比特序列配置，并且通过将当前时刻表示为比特序列并从第一比特序列连接几个比特来形成比特序列。时间装置产生多个解密密钥，作为对多个指定ID进行提取算法的结果而获得的解密密钥。加密装置指定多个ID。多个ID中的每一个由比特序列配置，该比特序列通过将指定的时刻表示为比特序列并从该比特序列的第一个连接几个比特来形成。加密装置读取从时间装置提供的加密密钥和多个ID，以加密相同的明文。加密装置产生多个密文。解密装置从输入的多个解密密钥中选择一个解密密钥，从输入的多个密文中选择一个密文。解密部分基于基于ID的加密方法使用所选择的解密密钥来解密所选择的密文。

27. 发明授权

US08127140B2 Group signature scheme 有权
标题翻译：组签名方案
公开(公告)号：US08127140B2
公开(公告)日：2012-02-28
申请号：US11795267
申请日：2005-12-13
申请人： Isamu Teranishi
发明人： Isamu Teranishi
IPC分类号： H04L9/32
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签名是安全的方法相同的方法中具有可提取性的特征。

28. 发明授权

US08121290B2 Pseudo-random function calculating device and method and number-limited anonymous authentication system and method 有权
标题翻译：伪随机函数计算装置及方法和数量限制匿名认证系统及方法
公开(公告)号：US08121290B2
公开(公告)日：2012-02-21
申请号：US11915561
申请日：2006-05-26
申请人： Isamu Teranishi
发明人： Isamu Teranishi
IPC分类号： H04L9/00 , H04L9/08
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.
摘要翻译：实现了使用这种功能的有效的伪随机函数和有效的有限次认证系统。伪随机函数计算装置包括密钥创建装置和伪随机函数计算装置。密钥创建装置创建由至少第一组件和第二组件组成的公钥作为构成有限组的元素的组件和由整数组成的秘密密钥，并将创建的秘密密钥秘密地保存在秘密密钥中记忆部分，但使公共密钥公开。伪随机函数计算装置在接收到整数作为输入时，输出有限群的元素作为伪随机函数的函数值。伪随机函数计算装置输出通过使用公钥的第一分量和输入的整数分别作为基数和指数来计算获得的值的第一元素的相乘乘积，以及第二元素的乘积通过使用公钥的第二分量和有限域中的秘密密钥和输入整数的和的倒数作为基础和分量来计算获得的幂数值。

29. 发明申请

US20100251351A1 INFORMATION AND COMMUNICATION SYSTEM, AN ORGANIZATION APPARATUS AND A USER APPARATUS 审中-公开
标题翻译：信息通信系统，组织装置和用户装置
公开(公告)号：US20100251351A1
公开(公告)日：2010-09-30
申请号：US12743553
申请日：2008-10-31
申请人： Isamu Teranishi
发明人： Isamu Teranishi
IPC分类号： H04L9/32 , G06F21/00
CPC分类号： G06F21/6245 , H04L9/3013 , H04L9/3218 , H04L9/3247 , H04L9/3263 , H04L2209/42
摘要： An information and communication system or the like which handles an attribute, at the same time enables the attribute not being made a public information, is efficient, and does not require a database should be provided.Pseudonym and validation tag generation means output validation tag including a commitment of a secret key of a user apparatus and a pseudonym, credential generation means outputs a signed document corresponding to a validation tag and a pseudonym as a credential, a user apparatus transmits a signed document to a verifier apparatus, a user apparatus proves to a verifier apparatus that a validation tag is a commitment of a secret key, a verifier apparatus verifies a signed document, and a verifier apparatus verifies the proof that a validation tag is a commitment of a secret key.
摘要翻译：处理属性的信息和通信系统等同时使属性不被做为公共信息，是有效的，并且不需要提供数据库。假名和验证标签生成意味着输出验证标签，包括用户装置的秘密密钥和假名的承诺，凭证产生装置输出对应于验证标签和假名的签名文档作为证书，用户装置发送签名文档用户装置向验证者装置证明验证标签是秘密密钥的承诺，验证器装置验证签名的文档，并且验证器装置验证验证标签是秘密承诺的证据键。

30. 发明申请

US20090271631A1 ELECTRONIC SIGNATURE SYSTEM AND ELECTRONIC SIGNATURE VERIFYING METHOD 有权
标题翻译：电子签名系统和电子签名验证方法
公开(公告)号：US20090271631A1
公开(公告)日：2009-10-29
申请号：US12439591
申请日：2007-04-13
申请人： Isamu Teranishi
发明人： Isamu Teranishi
IPC分类号： 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算法创建承诺，并通过使用承诺和第一签名进行验证。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式