会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for camouflaging access-controlled data
    • 伪装访问控制数据的方法和系统
    • US07454782B2
    • 2008-11-18
    • US10015902
    • 2001-10-30
    • Sanguthevar RajasekaranGeoffrey R. HirdBalas Natarajan Kausik
    • Sanguthevar RajasekaranGeoffrey R. HirdBalas Natarajan Kausik
    • H04L9/32
    • G06F21/62H04L9/0863H04L9/3226
    • A computer-representable object (including, without limitation, a cryptographic key, or a graph or a Boolean description of a system) is secured using a generalized camouflaging technique. The secured object need not be stored in the system, not even in encrypted form. Instead, the technique employs a composition function that regenerates the secured object when one inputs a valid password (which may be any computer-representable information held by a user). By regenerating the secured object each time a valid password is entered, there is no need to store the secured object. If one inputs an invalid password, the technique may generate an incorrect object, such that the user is unable to distinguish this incorrect object from the secured object. If the user tries to use the incorrect object, the user can be exposed as unauthorized, without the user's knowledge that he has been exposed.
    • 使用广义伪装技术来确保计算机可表示的对象(包括但不限于密码密钥,或图形或系统的布尔描述)。 安全对象不需要存储在系统中,甚至不加密形式。 相反,该技术采用组合函数,当一个输入有效密码(其可以是用户持有的任何计算机可表示的信息)时,重新生成安全对象​​。 每当输入有效的密码时,通过重新生成安全对象​​,就不需要存储安全对象。 如果输入无效的密码,则该技术可能会生成不正确的对象,使得用户无法将此不正确对象与安全对象区分开。 如果用户尝试使用不正确的对象,则用户可能会以未经授权的方式暴露,而无需用户知道他已被暴露。
    • 10. 发明授权
    • Efficient techniques for sharing a secret
    • 分享秘密的高效技术
    • US07167565B2
    • 2007-01-23
    • US09853913
    • 2001-05-11
    • Sanguthevar Rajasekaran
    • Sanguthevar Rajasekaran
    • H04L9/30H04L9/14
    • H04L9/085
    • An n person secret sharing solution computes n unique keys to be distributed to the secret owners along with an exponentiated version of the secret. The custodian performs an exponent/modulo operation each time one of the keys is received from one of the secret owners. Alternatively, n+1 keys are created by the custodian, and the custodian retains one key after distributing the remaining n keys to the secret owners. After the custodian has received and processed the n keys from the secret owners, he performs an exponent/modulo operation using his own retained key. According to another aspect, a k out of n secret sharing solution involves computing and storing a database having an entry for each unique combination of k keys that could be returned from among the n keys. After k keys have been received, the custodian looks up in the database the entry corresponding to the particular unique combination of secret owners who returned keys. The custodian performs another exponent/modulo operation using the entry retrieved from the database in order to reconstruct the original secret. According to an embodiment, the custodian computes n+1 keys, distributes n of the keys to the secret owners, and keeps one of the keys for himself. The custodian retrieves his own key and performs a final exponent/modulo operation in order to reconstruct the original secret. According to another aspect, a k out of n secret sharing solution involves encrypting the original secret before applying any conventional k out of n secret sharing solution.
    • 一个人的秘密共享解决方案计算出将被分配给秘密所有者的唯一密钥以及秘密的指数版本。 每当从秘密所有者之一接收到一个密钥时,保管人执行指数/模运算。 或者,保管人创建n + 1个密钥,保管人在将剩余的n个密钥分发给秘密所有者后,保留一个密钥。 在保管人从秘密所有者接收并处理了n个密钥后,他使用自己保留的密钥执行指数/模运算。 根据另一方面,n秘密共享解决方案涉及计算和存储具有可从n个密钥中返回的k个密钥的每个唯一组合的条目的数据库。 在接收到k个密钥之后,保管人在数据库中查找与返回密钥的秘密所有者的特定唯一组合相对应的条目。 保管人使用从数据库检索的条目执行另一指数/模运算,以重构原始秘密。 根据实施例,保管人计算n + 1个密钥,将密钥的n个分配给秘密所有者,并且保留其中一个密钥。 保管人检索自己的密钥并执行最后的指数/模运算,以重构原始秘密。 根据另一方面,n秘密共享解决方案涉及在应用n个秘密共享解决方案中的任何常规k之前加密原始秘密。