Average-complexity ideal-security order-preserving encryption
    11.
    发明授权
    Average-complexity ideal-security order-preserving encryption 有权
    平均复杂度理想的安全订单保存加密

    公开(公告)号:US09037860B1

    公开(公告)日:2015-05-19

    申请号:US14088123

    申请日:2013-11-22

    IPC分类号: H04L29/06

    摘要: Embodiments provide ideal security, order-preserving encryption (OPE) of data of average complexity, thereby allowing processing of the encrypted data (e.g. at a database server in response to received queries). Particular embodiments achieve high encryption efficiency by processing plaintext in the order preserved by an existing compression dictionary already available to a database. Encryption is based upon use of a binary search tree of n nodes, to construct an order-preserving encryption scheme having Ω(n) complexity and even O(n), in the average case. A probability of computationally intensive updating (which renders conventional OPE impractical for ideal security) is substantially reduced by leveraging the demonstrated tendency of a height of the binary search tree to be tightly centered around O(log n). An embodiment utilizing such an encryption scheme is described in the context of a column-store, in-memory database architecture comprising n elements. OPE according to embodiments is compatible with adjustable encryption approaches.

    摘要翻译: 实施例提供平均复杂度的数据的理想的安全性,订单保留加密(OPE),从而允许加密数据的处理(例如在数据库服务器响应于接收到的查询)。 特定实施例通过以数据库已经可用的现有压缩字典保存的顺序处理明文来实现高加密效率。 加密是基于使用n个节点的二叉搜索树来构造在平均情况下具有&OHgr(n)复杂度甚至O(n)的订单保留加密方案。 通过利用二叉搜索树的高度以O(log n)为中心的显示趋势,大大减少了计算密集型更新的概率(这使得传统OPE对理想安全性不切实际)。 在包含n个元素的列存储器内存数据库架构的上下文中描述了利用这种加密方案的实施例。 根据实施例的OPE与可调整的加密方法兼容。

    Comparing encrypted documents having structured data
    12.
    发明授权
    Comparing encrypted documents having structured data 有权
    比较具有结构化数据的加密文档

    公开(公告)号:US08726151B2

    公开(公告)日:2014-05-13

    申请号:US12757477

    申请日:2010-04-09

    IPC分类号: G06F17/24

    摘要: The present disclosure is directed to comparing a first structured data document to a second structured data document, including receiving the first and second structured data documents as first and second encrypted documents, respectively, comparing nodes of the first encrypted document to nodes of the second encrypted document, a content and a location of each of the nodes remaining confidential during the comparing, generating matched pairs of nodes based on the comparing, and storing the matched pairs in computer memory, each matched pair comprising a node of the first encrypted document and a corresponding node of the second encrypted document, determining one or more edit operations based on the matched pairs, and generating an edit script comprising the one or more edit operations, the edit script being executable to transform the first encrypted document to provide a transformed encrypted document that is isomorphic to the second encrypted document.

    摘要翻译: 本公开涉及将第一结构化数据文档与第二结构化数据文档进行比较,包括分别将第一和第二结构化数据文档作为第一和第二加密文档接收,将第一加密文档的节点与第二加密文档的节点进行比较 文档,每个节点的内容和位置在比较期间保持机密,基于比较生成匹配的节点对,并将匹配的对存储在计算机存储器中,每个匹配对包括第一加密文档的节点和 所述第二加密文档的相应节点,基于所述匹配对确定一个或多个编辑操作,以及生成包括所述一个或多个编辑操作的编辑脚本,所述编辑脚本可被执行以变换所述第一加密文档以提供转换的加密文档 这与第二个加密文档是同构的。

    PRIVACY PRESERVING SOCIAL NETWORK ANALYSIS
    13.
    发明申请
    PRIVACY PRESERVING SOCIAL NETWORK ANALYSIS 有权
    隐私保护社会网络分析

    公开(公告)号:US20100014657A1

    公开(公告)日:2010-01-21

    申请号:US12173829

    申请日:2008-07-16

    IPC分类号: H04L9/28

    摘要: A method and a system for privacy-preserving SNA. A plurality of vertices of a first subgraph of a graph is encrypted with a first key of a commutatively encryption scheme. A plurality of vertices of a second subgraph encrypted with a second key of the commutatively encryption scheme are received and encrypted commutatively with the first key. A plurality of commutatively encrypted vertices of the first subgraph and a plurality of commutatively encrypted vertices of the second subgraph are used for computing centrality metrics preserving the privacy of the graph and its structure.

    摘要翻译: 一种用于隐私保护SNA的方法和系统。 图形的第一子图的多个顶点用交换加密方案的第一密钥加密。 通过交换加密方案的第二密钥加密的第二子图的多个顶点被接收并与第一密钥交换加密。 使用第一子图的多个交换加密的顶点和第二子图的多个交换加密的顶点来计算保持图形及其结构的隐私的中心度量。

    MODELING OF TASK-BASED CONSTRAINTS AND AUTOMATED POLICY DERIVATION
    14.
    发明申请
    MODELING OF TASK-BASED CONSTRAINTS AND AUTOMATED POLICY DERIVATION 审中-公开
    基于任务的约束和自动化政策衍生的建模

    公开(公告)号:US20090083087A1

    公开(公告)日:2009-03-26

    申请号:US11858314

    申请日:2007-09-20

    IPC分类号: G06Q10/00

    CPC分类号: G06Q10/00 G06Q10/0633

    摘要: A method and system for the augmentation of at least one task of a business process model are described, such augmentation including receiving a task-based authorization constraint to be applied to the at least one task. An augmented business process model is generated utilizing the business process model and the task-based authorization constraint. An authorization policy is automatically derived from the augmented business process model.

    摘要翻译: 描述了用于增加业务流程模型的至少一个任务的方法和系统,这种增加包括接收要应用于至少一个任务的基于任务的授权约束。 使用业务流程模型和基于任务的授权约束生成增强的业务流程模型。 从增强的业务流程模型自动导出授权策略。

    Optimal Re-Encryption Strategy for Joins in Encrypted Databases
    16.
    发明申请
    Optimal Re-Encryption Strategy for Joins in Encrypted Databases 有权
    加密数据库连接的最佳重新加密策略

    公开(公告)号:US20150019879A1

    公开(公告)日:2015-01-15

    申请号:US13938571

    申请日:2013-07-10

    IPC分类号: G06F21/60

    摘要: Methods, systems, and computer-readable storage media for selecting columns for re-encryption in join operations. In some implementations, actions include determining a first column and a second column to be joined, receiving a first key corresponding to the first column and a second key corresponding to the second column, receiving a first rank associated with the first key and a second rank associated with the second key, selecting the second column for re-encryption based on the first rank and the second rank, and providing the first column, the second column, and the first key for performing a join operation, the second column being re-encrypted based on the first key.

    摘要翻译: 用于在连接操作中选择用于重新加密的列的方法,系统和计算机可读存储介质。 在一些实现中,动作包括确定要连接的第一列和第二列,接收对应于第一列的第一键和对应于第二列的第二键,接收与第一键相关联的第一列和第二列 与所述第二密钥相关联,基于所述第一等级和所述第二等级选择所述第二列进行重新加密,并且提供所述第一列,所述第二列和用于执行连接操作的所述第一密钥, 基于第一个密钥进行加密。

    ENTERPRISE DATA-DRIVEN SYSTEM FOR PREDICTIVE RESOURCE PROVISIONING IN CLOUD ENVIRONMENTS
    17.
    发明申请
    ENTERPRISE DATA-DRIVEN SYSTEM FOR PREDICTIVE RESOURCE PROVISIONING IN CLOUD ENVIRONMENTS 有权
    企业数据驱动系统,用于预测资源在云环境中的投放

    公开(公告)号:US20150006711A1

    公开(公告)日:2015-01-01

    申请号:US13928998

    申请日:2013-06-27

    申请人: Andreas Schaad

    发明人: Andreas Schaad

    IPC分类号: H04L12/26

    摘要: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for predicting resource consumption in cloud infrastructures. Implementations include actions of receiving event data from one or more enterprise data sources, determining that an event associated with the event data is a known event, retrieving resource consumption information associated with the event, and providing a resource consumption schedule to a cloud infrastructure, the resource consumption schedule indicating resources expected to be consumed during execution of the event.

    摘要翻译: 本公开的实现包括用于预测云基础设施中的资源消耗的方法,系统和计算机可读存储介质。 实现包括从一个或多个企业数据源接收事件数据的动作,确定与事件数据相关联的事件是已知事件,检索与该事件相关联的资源消耗信息,以及向云基础设施提供资源消耗调度, 指示在事件执行期间预期消耗的资源的资源消耗计划。

    Mechanism to control delegation and revocation of tasks in workflow system
    18.
    发明授权
    Mechanism to control delegation and revocation of tasks in workflow system 有权
    控制工作流系统任务授权和撤销的机制

    公开(公告)号:US08620713B2

    公开(公告)日:2013-12-31

    申请号:US11183272

    申请日:2005-07-15

    申请人: Andreas Schaad

    发明人: Andreas Schaad

    IPC分类号: G06Q10/00

    摘要: A method to revoke a task includes receiving task data, the task data including information regarding a task to be performed. The method further includes receiving delegation data, the delegation data including information identifying a delegator of the task and a delegatee to perform the task. The method further includes receiving revocation task data, with the revocation task data having as its object at least aspects of the task.

    摘要翻译: 撤销任务的方法包括接收任务数据,任务数据包括关于要执行的任务的信息。 该方法还包括接收委托数据,委托数据包括标识任务的委托者的信息和执行该任务的委托人。 所述方法还包括接收撤销任务数据,其中所述撤销任务数据在所述任务的至少方面中具有作为其对象的对象。

    AGILE WORKFLOW MODELING AND EXECUTION BASED ON DOCUMENT
    19.
    发明申请
    AGILE WORKFLOW MODELING AND EXECUTION BASED ON DOCUMENT 审中-公开
    基于文档的AGILE工作流建模与执行

    公开(公告)号:US20120030122A1

    公开(公告)日:2012-02-02

    申请号:US12844508

    申请日:2010-07-27

    IPC分类号: G06Q10/00

    CPC分类号: G06Q10/103 G06Q10/06

    摘要: A workflow document processing machine supports agile modeling and agile execution of a workflow that comprises tasks, one or more of which may be dynamically added, changed, or identified during execution of the workflow. The workflow document processing machine accesses a pre-process workflow document, a tactical goal data structure, and business process data resultant from execution of a task pertinent to the workflow. The workflow document processing machine modifies a document portion based on the task data structure and on the business process data. Based on the pre-process workflow document and on the modified document portion, the workflow document processing machine generates a post-process workflow document, which may be accessed as a pre-process workflow document by another machine.

    摘要翻译: 工作流文档处理机器支持敏捷建模和敏捷执行工作流程,该工作流包括任务,其中一个或多个可以在执行工作流程期间被动态添加,更改或标识。 工作流文档处理机器访问与处理工作流有关的任务的执行所产生的预处理工作流文档,战术目标数据结构和业务处理数据。 工作流文档处理机根据任务数据结构和业务流程数据修改文档部分。 基于预处理工作流程文档和修改的文档部分,工作流文档处理机器生成后处理工作流文档,其可以由另一机器作为预处理工作流文档访问。

    SYSTEM TO AVOID POLICY-BASED DEADLOCKS IN WORKFLOW EXECUTION
    20.
    发明申请
    SYSTEM TO AVOID POLICY-BASED DEADLOCKS IN WORKFLOW EXECUTION 审中-公开
    在工作流程中避免基于政策的死刑犯的制度

    公开(公告)号:US20090198548A1

    公开(公告)日:2009-08-06

    申请号:US12025889

    申请日:2008-02-05

    IPC分类号: G06Q10/00 G06F17/00

    CPC分类号: G06Q10/06 G06Q10/0633

    摘要: A computer-implemented method avoids policy-based deadlocks in execution of a workflow. The method includes receiving information describing a workflow. The workflow includes tasks, roles, site of tasks and security constraints related to the tasks. A data structure, representative of relationships between the tasks and the security constraints is automatically generated. An automated, design-time evaluation is performed using the data structure to determine a minimal number of resources to be assigned to the roles in order to execute the tasks of the workflow, and to avoid deadlock in execution of the tasks of the workflow as a result of security constraints.

    摘要翻译: 计算机实现的方法可以避免执行工作流时基于策略的死锁。 该方法包括接收描述工作流的信息。 工作流包括与任务相关的任务,角色,任务站点和安全约束。 自动生成代表任务与安全约束之间关系的数据结构。 使用数据结构执行自动化的设计时评估,以确定要分配给角色的资源的最少数量以执行工作流的任务,并且避免在执行工作流的任务时的死锁 安全约束的结果。