公开(公告)号：US08473493B2

公开(公告)日：2013-06-25

申请号：US12693703

申请日：2010-01-26

申请人： Hongxia Jin ,  Qihua Wang

发明人： Hongxia Jin ,  Qihua Wang

IPC分类号： G06F17/30

CPC分类号： G06Q10/107 ,  H04L67/2804 ,  H04W4/185

摘要： A method and system of automatically identifying a set of relevant and qualified recipients to share electronic data is disclosed. The system includes an electronic network configured to store and transmit the electronic data files. The electronic data files include one or more data tags defining a sharing condition that targets potential recipients of the data files or permits access to the data files. A people-tagging system provides an electronic platform including keyword lists (tags) defined by recipient users collaboratively. A matching tool includes software matching recipient users to the data files when the recipient users are associated with keyword lists that satisfy the sharing condition. The method includes tagging a data file by one or more keywords and using a people-tagging system where the recipient users define a list of tags on topics of interest. Recipient users are matched to data files when user lists of tags satisfying the sharing condition.

摘要翻译： 公开了一种自动识别一组相关和合格的接收者共享电子数据的方法和系统。 该系统包括被配置为存储和发送电子数据文件的电子网络。 电子数据文件包括定义共享条件的一个或多个数据标签，其目标是数据文件的潜在接收者或允许访问数据文件。 人员标签系统提供电子平台，包括由收件人用户协作定义的关键字列表（标签）。 匹配工具包括当收件人用户与满足共享条件的关键字列表相关联时，将收件人用户与数据文件相匹配的软件。 该方法包括通过一个或多个关键字标记数据文件，并使用人员标签系统，其中接收者用户定义关注主题的标签列表。 用户列表满足共享条件时，收件人用户与数据文件匹配。

公开(公告)号：US20130014278A1

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

申请号：US13176011

申请日：2011-07-05

申请人： Hongxia Jin ,  Scott Schumacher ,  Qihua Wang

发明人： Hongxia Jin ,  Scott Schumacher ,  Qihua Wang

IPC分类号： G06F17/30 ,  G06F21/24

CPC分类号： G06F19/322 ,  G06F19/00 ,  G16H10/60

摘要： Embodiments of the invention relate to a system and computer program product to intelligently provide consent to access a record in a shared pool of resources. Tools are provided to support policies to address and maintain restrictive access of a designated record, both with respect to local and non-local rules and regulations, as well as personal restrictions pertaining to personal and discretionary sharing decisions.

摘要翻译： 本发明的实施例涉及一种系统和计算机程序产品，用于智能地提供访问共享资源池中的记录的同意。 提供工具来支持政策，以解决和保持指定记录的限制性访问，无论是关于本地和非本地的规则和条例，还有关于个人和酌情分享决定的个人限制。

公开(公告)号：US08121287B2

公开(公告)日：2012-02-21

申请号：US12133736

申请日：2008-06-05

申请人： Hongxia Jin ,  Jeffrey Bruce Lotsprech

发明人： Hongxia Jin ,  Jeffrey Bruce Lotsprech

IPC分类号： H04K1/04

CPC分类号： H04L9/32 ,  G06F21/10 ,  G09C5/00 ,  G11B20/00086 ,  G11B20/00137 ,  G11B20/0021 ,  G11B20/00362 ,  G11B20/00427 ,  G11B20/00507 ,  H04H60/18 ,  H04H60/23 ,  H04L9/0822 ,  H04L2209/606 ,  H04N21/23476 ,  H04N21/26613 ,  H04N21/42646 ,  H04N21/44055 ,  H04N21/8456

摘要： A unified broadcast encryption system divides a media key tree into S subtrees, divides digital content into segments, and converts some of the segments into variations; the number of segments and variations is q. The system subdivides each of the subtrees into q/|S| subdivided subtrees, assigns a key media variant to each of the subdivided subtrees, and generates a unified media key block (MKBu). The system decrypts digital content by obtaining required key media variants from the MKBu, using the key media variant to find an entry in a variant key table, decrypt a title key, and locate a variant number from the variant key table. The system uses the variant number to identify which of the variations may be decrypted by the title key and uses the title key to decrypt segments and variations.

摘要翻译： 统一广播加密系统将媒体密钥树划分为S子树，将数字内容划分为多个段，并将其中的一些段转换为变体; 段数和变化数为q。 系统将每个子树细分为q / | S | 细分子树，将关键媒体变体分配给每个细分子树，并生成统一的媒体关键块（MKBu）。 该系统通过从MKBu获得所需的密钥介质变体来解密数字内容，使用密钥介质变体来找到变体密钥表中的条目，解密标题密钥以及从变体密钥表中定位变体号。 系统使用变体号来标识哪个变体可以由标题密钥解密，并使用标题密钥来解密段和变体。

公开(公告)号：US20090214031A1

公开(公告)日：2009-08-27

申请号：US12038773

申请日：2008-02-27

申请人： Hongxia Jin ,  Jeffrey Bruce Lotspiech

发明人： Hongxia Jin ,  Jeffrey Bruce Lotspiech

IPC分类号： H04N7/167 ,  H04L9/00

CPC分类号： H04L9/0836 ,  G09C5/00 ,  H04L2209/606

摘要： A system and method is disclosed for performing unified broadcast encryption and traitor tracing for digital content. In one embodiment a media key tree is divided into S subtrees, the media key tree including media keys and initial values, which may be random values. The digital content is divided into a plurality of segments and at least some of the segments are converted into a plurality of variations. The random values are transformed into media key variations and a separate media key variant is assigned to each of the subdivided subtrees. A unified media key block including the media key tree is stored on the media.

摘要翻译： 公开了一种用于对数字内容进行统一广播加密和叛逆追踪的系统和方法。 在一个实施例中，媒体密钥树被划分为S子树，媒体密钥树包括媒体密钥和初始值，其可以是随机值。 数字内容被分成多个段，并且至少一些段转换成多个变体。 将随机值转换为媒体密钥变体，并将分离的媒体密钥变体分配给每个细分子树。 包含媒体密钥树的统一媒体密钥块被存储在媒体上。

公开(公告)号：US07516331B2

公开(公告)日：2009-04-07

申请号：US10723725

申请日：2003-11-26

申请人： Hongxia Jin ,  Donald E. Leake, Jr. ,  Jeffrey B. Lotspiech ,  Sigfredo I. Nin ,  Wilfred E. Plouffe

发明人： Hongxia Jin ,  Donald E. Leake, Jr. ,  Jeffrey B. Lotspiech ,  Sigfredo I. Nin ,  Wilfred E. Plouffe

IPC分类号： H04L9/32

CPC分类号： G06F21/6218 ,  G06F21/14 ,  G06F21/51

摘要： A trusted Java virtual machine provides a method for supporting tamper-resistant applications, ensuring the integrity of an application and its secrets such as keys. The trusted Java virtual machine verifies the integrity of the Java application, prevents debugging of the Java application, and allows the Java application to securely store and retrieve secrets. The trusted Java virtual machine environment comprises a TrustedDictionary, a TrustedBundle, an optional encryption method for encrypting and decrypting byte codes, and an underlying trusted Java virtual machine. The encrypted TrustedDictionary protects data while the TrustedBundle protects programming code, allowing applications to store secret data and secure counters. The application designer can restrict TrustedBundle access to only those interfaces that the application designer explicitly exports. The open source code may optionally be encrypted. Secrets required by the open source programming code of the application are encrypted in TrustedDictionary.

摘要翻译： 受信任的Java虚拟机提供了一种支持防篡改应用程序的方法，确保应用程序的完整性及其密钥（如密钥）。 受信任的Java虚拟机验证Java应用程序的完整性，防止Java应用程序的调试，并允许Java应用程序安全地存储和检索秘密。 受信任的Java虚拟机环境包括TrustedDictionary，TrustedBundle，用于加密和解密字节代码的可选加密方法，以及底层可信Java虚拟机。 加密的TrustedDictionary保护数据，而TrustedBundle保护编程代码，允许应用程序存储秘密数据和安全计数器。 应用程序设计人员可以将TrustedBundle访问限制为应用程序设计程序明确导出的那些接口。 可以可选地加密开源代码。 应用程序的开源编程代码所需的秘密在TrustedDictionary中加密。

公开(公告)号：US07505593B2

公开(公告)日：2009-03-17

申请号：US10315395

申请日：2002-12-09

申请人： Hongxia Jin ,  Jeffrey Bruce Lotspiech

发明人： Hongxia Jin ,  Jeffrey Bruce Lotspiech

IPC分类号： H04N7/167

CPC分类号： G09C5/00 ,  G11B20/00086 ,  G11B20/00173 ,  G11B20/0021 ,  G11B20/00224 ,  G11B20/00507 ,  G11B20/00884 ,  H04L9/0833 ,  H04L9/0891 ,  H04L63/0428 ,  H04L2209/606 ,  H04L2463/101 ,  H04N7/165 ,  H04N21/2585

摘要： A method for disabling a traitor receiver in a broadcast encryption system includes examining augmentations of at least one redistributed version of a file in a group of files, wherein each authorized receiver acquired decryption keys only for the particular augmentations that it used. A level to which the augmentations correspond to a first set of super codes previously assigned to each authorized receiver is determined. A conclusion is drawn regarding the number of receivers that are traitor receivers. The receivers concluded to be traitor are selectively revoked. The process is repeated by selecting another set of super codes; selected to reduce the number of authorized receivers concluded to be traitor receivers. The sets of super codes are selected such that the number is made larger to achieve quicker revocation of a traitor receiver at the cost of increasing chance of an incorrect revocation of an innocent receiver.

摘要翻译： 一种用于在广播加密系统中禁用叛徒接收机的方法包括：检查一组文件中的文件的至少一个重新分发版本的扩充，其中每个授权的接收方仅为其所使用的特定扩充获取解密密钥。 确定增加对应于先前分配给每个授权接收机的第一组超级代码的级别。 得出关于作为叛徒接收机的接收机的数量的结论。 被认定为叛徒的接收者被选择性地撤销。 通过选择另一组超级代码重复该过程; 选择减少被认定为叛国接收者的授权接收机的数量。 选择这些超级代码，使得数字更大以便以增加无辜接收者的不正确撤销的机会为代价来更快地撤销叛徒接收者。

公开(公告)号：US20090049308A1

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

申请号：US12135052

申请日：2008-06-06

申请人： Hongxia Jin ,  Jeffrey Bruce Lotspiech ,  Ginger M. Myles

发明人： Hongxia Jin ,  Jeffrey Bruce Lotspiech ,  Ginger M. Myles

IPC分类号： H04L9/06

CPC分类号： G06F21/14

摘要： A system, method, and computer program product for preventing a malicious user from analyzing and modifying software content. The one-way functions used in prior art systems using dynamically evolving audit logs or self-modifying applications are replaced with a one-way function based on group theory. With this modification, untampered key evolution will occur inside a defined mathematical group such that all valid key values form a subgroup. However, if the program is altered, the key will evolve incorrectly and will no longer be a member of the subgroup. Once the key value is outside of the subgroup, it is not possible to return it to the subgroup. The present invention provides a limited total number of valid keys. The key evolution points are not restricted to locations along the deterministic path, so the key can be used in various novel ways to regulate the program's behavior, including in non-deterministic execution paths.

摘要翻译： 一种用于防止恶意用户分析和修改软件内容的系统，方法和计算机程序产品。 使用动态演进的审计日志或自修改应用程序的现有技术系统中使用的单向函数被基于组理论的单向函数所取代。 通过这种修改，无限制的密钥演进将发生在定义的数学组内，使得所有有效的密钥值形成一个子组。 但是，如果程序被更改，则密钥将不正确地发展，不再是该子组的成员。 一旦键值超出了子组，就不可能将其返回到子组。 本发明提供了有限的总数量的有效密钥。 关键演化点不仅限于确定路径上的位置，所以密钥可以以各种新颖的方式用于调节程序的行为，包括在非确定性执行路径中。

公开(公告)号：US20080137864A1

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

申请号：US11608268

申请日：2006-12-08

申请人： Hongxia Jin ,  Jeffrey Bruce Lotspiech ,  Philip Anastasios Zigoris

发明人： Hongxia Jin ,  Jeffrey Bruce Lotspiech ,  Philip Anastasios Zigoris

IPC分类号： H04L9/16 ,  G06F17/50

CPC分类号： H04L9/32 ,  G09C5/00 ,  H04L9/0891 ,  H04L2209/606

摘要： A traitor tracing system generates a hypothesized model of the circumvention device that models a hypothesized set of device keys compromised by the circumvention device. The system iteratively invokes a subset tracing system to identify a compromised device key until substantially all the compromised device keys in the set of compromised device keys are identified so as to disable the circumvention device. A subset tracing system generates a circumvention device model that models behavior of a circumvention device using prior knowledge and The system iteratively selects and applies to the circumvention device a test based on the hypothesized model and the circumvention device model and receives a response from the circumvention device indicating a success of the test in playing protected content on the circumvention device. The system updates the hypothesized model using the received response, the selected test, a current version of the hypothesized model, and a current version of the circumvention device model to focus the test selecting process in determining the device keys obtained from the traitor.

摘要翻译： 叛逆者追踪系统产生对避开装置的假设模型，以模拟被规避装置损害的假设的一组装置钥匙。 系统迭代地调用子集跟踪系统以识别受损的设备密钥，直到被识别的设备密钥集中的基本上所有受损设备密钥被识别为禁用规避设备。 子集跟踪系统生成规避设备模型，其使用先验知识对规避设备的行为进行建模，并且系统基于假设模型和规避设备模型迭代地选择并应用到规避设备的测试，并且接收来自规避设备的响应 表明在规避设备上播放受保护内容的测试成功。 系统使用接收到的响应，所选择的测试，假设模型的当前版本和规避设备模型的当前版本来更新假设模型，以将测试选择过程集中在确定从叛徒获得的设备密钥。

公开(公告)号：US20070165853A1

公开(公告)日：2007-07-19

申请号：US11323247

申请日：2005-12-30

申请人： Hongxia Jin ,  Jeffrey Lotspiech

发明人： Hongxia Jin ,  Jeffrey Lotspiech

IPC分类号： H04N7/167

CPC分类号： H04N7/165 ,  H04L9/08 ,  H04L2209/606 ,  H04N21/2585

摘要： A system, method, and computer program product to find coalitions of receivers who collude to produce pirated protected content, then evaluates the confidence that particular members of each identified coalition are traitors versus innocent receivers incriminated by chance. Typically, each file in a group of original files is modified to include variations of critical file segments. The group of files is then broadcast with individualized codes that enable particular authorized receivers to properly process the modified files. The modifications in a pirated version of a file can identify which traitorous receivers contributed to its piracy. Candidate coalitions of differing size are first evaluated to determine if they cover observed file variations with greater than a predetermined likelihood that an innocent coalition is falsely incriminated by chance. Individual members of satisfactory coalitions are then evaluated. Traitors may be cryptographically revoked.

摘要翻译： 一种系统，方法和计算机程序产品，用于查找串联产生盗版保护内容的接收者联盟，然后评估每个已识别联盟的特定成员是叛徒的机会与被机会犯罪的无辜接收者的信心。 通常，一组原始文件中的每个文件都被修改为包括关键文件段的变体。 然后使用个性化代码广播文件组，使得特定授权的接收者能够正确处理修改的文件。 盗版版本的文件的修改可以识别哪些叛国接收器对其盗版作出贡献。 首先评估不同大小的候选联盟，以确定它们是否覆盖观察到的文件差异，超过预期的可能性，无辜的联盟被机会错误地引诱。 然后评估满意联盟的个人成员。 叛徒可能被加密地撤销。

公开(公告)号：US20070067244A1

公开(公告)日：2007-03-22

申请号：US11230022

申请日：2005-09-19

申请人： Hongxia Jin ,  Jeffrey Lotspiech ,  Sigfredo Nin

发明人： Hongxia Jin ,  Jeffrey Lotspiech ,  Sigfredo Nin

IPC分类号： G06Q99/00

CPC分类号： H04L9/3268 ,  H04L9/083 ,  H04L9/0891 ,  H04L9/3247 ,  H04L63/061 ,  H04L2209/601 ,  H04L2209/606

摘要： A system, method, and computer program product to renewably prevent traitors in a broadcast encryption system from re-using compromised keys. A license agency assigns individual receivers a set of Sequence Keys preferably at manufacture, and assigns Sequence Key Blocks (SKBs) to protected content files to be distributed. The files may be distributed on prerecorded media and typically include several file modifications. The particular modifications in a pirated version of a file can help identify which traitors contributed to its theft. SKBs assigned to new files distributed after traitors have been identified cannot be usefully processed using the compromised keys employed in previous content piracy. Innocent receivers that happen to have compromised key(s) in common with traitors can use a replacement uncompromised Sequence Key from the set to usefully decrypt content. Traitors will however step through all their Sequence Keys without reaching one that will work.

摘要翻译： 可重新防止广播加密系统中的叛逃者重新使用受损密钥的系统，方法和计算机程序产品。 许可代理机构优先为制造商分配一组序列密钥，并将序列密钥块（SKB）分配给要分发的受保护内容文件。 文件可以分布在预先记录的媒体上，通常包括几个文件修改。 盗版版本的特定修改可以帮助您识别哪些叛徒造成其盗用。 分配给叛逃者识别后分发的新文件的SKB无法使用先前内容盗版中使用的受损密钥进行有效的处理。 无辜的接收者碰巧损害了与叛逆者共同的密钥，可以使用该集合中的替代未妥协的序列密钥来有效解密内容。 然而，叛徒将逐步通过所有的序列键，而不会达到可以工作的顺序键。