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

1. 发明授权

US08452984B2 Message authentication code pre-computation with applications to secure memory 有权
标题翻译：消息认证代码预先计算与应用程序以保护内存
公开(公告)号：US08452984B2
公开(公告)日：2013-05-28
申请号：US12229987
申请日：2008-08-28
申请人： Juan A. Garay , Vladimir Kolesnikov , Hubert Rae McLellan
发明人： Juan A. Garay , Vladimir Kolesnikov , Hubert Rae McLellan
IPC分类号： G06F11/30
CPC分类号： G06F21/71 , H04L9/0631 , H04L9/0643 , H04L9/3242
摘要： A method comprising the steps of creating a random permutation of data from a data input by executing at least one of a Pseudo-Random Permutation (PRP) and a Pseudo-Random Function (PRF), creating a first data block by combining the random permutation of data with a received second data block and executing an ε-differentially uniform function on the result of the combination, XORing the result of the ε-DU function evaluation with a secret key, and reducing the first data block to a first message authentication code.
摘要翻译：一种方法，包括以下步骤：通过执行伪随机置换（PRP）和伪随机函数（PRF）中的至少一个来创建来自数据输入的数据的随机置换，通过组合随机排列来创建第一数据块的数据与所接收的第二数据块并且对所述组合的结果执行ε-差分均匀的函数，使用秘密密钥对所述epsilon-DU功能评估的结果进行异或，并将所述第一数据块减少到第一消息认证码。

2. 发明申请

US20100058070A1 Message authentication code pre-computation with applications to secure memory 有权
标题翻译：消息认证代码预先计算与应用程序以保护内存
公开(公告)号：US20100058070A1
公开(公告)日：2010-03-04
申请号：US12229987
申请日：2008-08-28
申请人： Juan A. Garay , Vladimir Kolesnikov , Hubert Rae McLellan
发明人： Juan A. Garay , Vladimir Kolesnikov , Hubert Rae McLellan
IPC分类号： G06F12/14 , H04L9/14
CPC分类号： G06F21/71 , H04L9/0631 , H04L9/0643 , H04L9/3242
摘要： A method comprising the steps of creating a random permutation of data from a data input by executing at least one of a Pseudo-Random Permutation (PRP) and a Pseudo-Random Function (PRF), creating a first data block by combining the random permutation of data with a received second data block and executing an ε-differentially uniform function on the result of the combination, XORing the result of the ε-DU function evaluation with a secret key, and reducing the first data block to a first message authentication code.
摘要翻译：一种方法，包括以下步骤：通过执行伪随机置换（PRP）和伪随机函数（PRF）中的至少一个来创建来自数据输入的数据的随机置换，通过组合随机排列来创建第一数据块的数据与接收到的第二数据块并且对组合的结果执行一个均匀的均匀函数，使用秘密密钥对“e”-DU功能评估的结果进行异或，并将第一数据块减少到第一消息验证码。

3. 发明授权

US08881295B2 Garbled circuit generation in a leakage-resilient manner 有权
标题翻译：混乱电路产生的漏电弹性
公开(公告)号：US08881295B2
公开(公告)日：2014-11-04
申请号：US13173612
申请日：2011-06-30
申请人： Vladimir Kolesnikov , Virendra Kumar
发明人： Vladimir Kolesnikov , Virendra Kumar
IPC分类号： G06F7/04 , H04L9/06
CPC分类号： H04L9/0662 , H04L9/14 , H04L9/28 , H04L9/3249 , H04L2209/12 , H04L2209/127 , H04L2209/46
摘要： Methods and apparatus are provided for generating a garbled circuit for a client in a leakage-resilient manner, for use in secure function evaluation between the client and a server. The garbled circuit is generated by obtaining a token from the server, wherein said token comprises a leakage-protected area; querying the token gate-by-gate, wherein for each gate of said garbled circuit, the token interacts with the leakage-protected area to generate a garbled table for the gate; and receiving the garbled circuit from the token. The client can interact with the server to obtain garbled inputs; and then evaluate the garbled circuit on the garbled inputs to obtain a garbled output. A final output can be obtained by matching the garbled output with an output table in the garbled circuit.
摘要翻译：提供了用于以泄漏弹性方式为客户端生成乱码电路的方法和装置，用于客户机和服务器之间的安全功能评估。通过从服务器获取令牌来产生乱码电路，其中所述令牌包括泄漏保护区域; 逐个询问令牌，其中对于所述乱码电路的每个门令牌，令牌与泄漏保护区域相互作用以产生用于门的乱码表; 并从令牌接收乱码电路。客户端可以与服务器交互以获得乱码输入; 然后评估乱码输入上的乱码电路，以获得乱码。可以通过将乱码输出与乱码电路中的输出表相匹配来获得最终输出。

4. 发明申请

US20140149921A1 Using Clamping to Modify Scrolling 审中-公开
标题翻译：使用夹紧修改滚动
公开(公告)号：US20140149921A1
公开(公告)日：2014-05-29
申请号：US13689598
申请日：2012-11-29
申请人： Jasper Reid Hauser , Jasleen Singh , Jonathan M. Kaldor , William S. Bailey , Vladimir Kolesnikov
发明人： Jasper Reid Hauser , Jasleen Singh , Jonathan M. Kaldor , William S. Bailey , Vladimir Kolesnikov
IPC分类号： G06F3/0485
CPC分类号： G06F3/0485 , G06F3/0488
摘要： In one embodiment, a method includes receiving user input to scroll within a GUI on a touch screen. The user input includes a touch gesture having a path that includes a starting point and one or more other points on the touch screen. The computing device determines regions of the touch screen defined with respect to the starting point. A first one of the regions corresponds to a first scrolling axis, and a second one of the regions corresponds to a second scrolling axis perpendicular to the first scrolling axis. If the path corresponds to the first region, then the computing device scrolls within the GUI according to the user input linearly and parallel to the first scrolling axis. If the path corresponds to the second region, then the computing device scrolls within the GUI according to the user input linearly and parallel to the second scrolling axis.
摘要翻译：在一个实施例中，一种方法包括接收在触摸屏上的GUI内滚动的用户输入。用户输入包括具有路径的触摸手势，该路径包括触摸屏上的起点和一个或多个其他点。计算设备确定相对于起始点定义的触摸屏的区域。所述区域中的第一个对应于第一滚动轴，并且所述区域中的第二个对应于垂直于所述第一滚动轴线的第二滚动轴。如果路径对应于第一区域，则计算设备根据用户输入线性地并平行于第一滚动轴在GUI内滚动。如果路径对应于第二区域，则计算设备根据用户输入线性地并平行于第二滚动轴在GUI内滚动。

5. 发明申请

US20100306543A1 Method of efficient secure function evaluation using resettable tamper-resistant hardware tokens 有权
标题翻译：使用可重置的防篡改硬件令牌的高效安全功能评估方法
公开(公告)号：US20100306543A1
公开(公告)日：2010-12-02
申请号：US12455193
申请日：2009-05-29
申请人： Vladimir Kolesnikov
发明人： Vladimir Kolesnikov
IPC分类号： H04L9/00 , H04L9/14
CPC分类号： G06F21/606 , H04L9/0662 , H04L9/0897 , H04L9/3234 , H04L9/3271 , H04L2209/50
摘要： An embodiment of the present invention provides a computer implemented method for the transfer of private information of one user to another user—a primitive known as Oblivious Transfer. An output from a strong pseudorandom function generation (SPRFG) is calculated by a first user's computing module based on first and second parameters: the first parameter specifying one of two secret keys; the second parameter being a value selected within the domain of the SPRFG by the first user. The first user is prevented from reading or learning the stored two secret keys. The output is transmitted to a computer of a second user which generates first and second encrypted values that are each based on an inverse SPRFG calculation using the first and second secret keys, respectively, and corresponding private values of the second user. The encrypted values are sent to a first computer of the first user that calculates one of the private values using a mathematical computation based on the second parameter and the one of the first and second encrypted values that corresponds to the one of the first and second key used.
摘要翻译：本发明的一个实施例提供了一种计算机实现的方法，用于将一个用户的私人信息传送给另一个用户 - 被称为永久传递的原语。来自强伪随机函数生成（SPRFG）的输出由第一用户计算模块基于第一和第二参数计算：第一参数指定两个秘密密钥之一; 第二参数是由第一用户在SPRFG的域内选择的值。阻止第一用户阅读或学习所存储的两个秘密密钥。输出被发送到第二用户的计算机，其产生分别基于使用第一和第二秘密密钥的反向SPRFG计算以及第二用户的对应私有值的第一和第二加密值。将加密的值发送到第一用户的第一计算机，该第一计算机使用基于第二参数的数学计算和与第一和第二密钥中的一个对应的第一和第二加密值中的一个来计算私有值之一用过的。

6. 发明申请

US20130031371A1 Software Run-Time Provenance 审中-公开
标题翻译：软件运行时产生
公开(公告)号：US20130031371A1
公开(公告)日：2013-01-31
申请号：US13189609
申请日：2011-07-25
申请人： Hubert R. McLellan , Vladimir Kolesnikov
发明人： Hubert R. McLellan , Vladimir Kolesnikov
IPC分类号： H04L9/32
CPC分类号： G06F21/575
摘要： An executing first computing module verifies the run-time provenance of an unverified second computing module. A signed certificate identifying an author of the second computing module is received at the first computing module. An association between the signed certificate and the second computing module is verified. A first provenance certificate and associated private key signed by the first computing module and identifying a runtime provenance of the second computing module is then generated, and the first provenance certificate is published to the second computing module. A chain of signed certificates, including provenance certificates and a static identification certificates, can be published. Each provenance certificate in the chain verifies the integrity of a layer of execution, and the plurality of static identification certificates identifies a respective author of the computing module associated with each layer of software. The provenance of the second computing module can be recursively traced through the published chain of certificates.
摘要翻译：执行的第一计算模块验证未验证的第二计算模块的运行时间来源。在第一计算模块处接收识别第二计算模块的作者的签名证书。验证签名证书和第二计算模块之间的关联。然后生成由第一计算模块签名并识别第二计算模块的运行时源的第一来源证书和相关联的私钥，并且将第一来源证书发布到第二计算模块。可以发布一系列签名证书，包括出货凭证和静态认证证书。链中的每个来源证书验证执行层的完整性，并且多个静态识别证书识别与每层软件相关联的计算模块的相应作者。第二个计算模块的来源可以通过发布的证书链递归地追踪。

7. 发明申请

US20120137117A1 SYSTEM AND METHOD FOR PROVIDING SECURE VIRTUAL MACHINES 有权
标题翻译：用于提供安全虚拟机的系统和方法
公开(公告)号：US20120137117A1
公开(公告)日：2012-05-31
申请号：US13379398
申请日：2010-07-16
申请人： Peter Bosch , Vladimir Kolesnikov , Sape Mullender , Jim Mckie , Philippe Dobbelaere , Hubert Mclellan
发明人： Peter Bosch , Vladimir Kolesnikov , Sape Mullender , Jim Mckie , Philippe Dobbelaere , Hubert Mclellan
IPC分类号： G06F21/00 , G06F9/00
CPC分类号： G06F21/53 , G06F21/572
摘要： The present invention provides improved security in a virtual machine. By extending the capabilities of modern secure processors, privacy of computation is provided from both the owner of the equipment and other users executing on the processor, which is an advantageous feature for rentable, secure computers. In addition to the hardware extensions required to secure a virtualizable computer, an infrastructure for the deployment of such processors is also provided. Furthermore, a signaling flow to establish the various relationships between the owner, user and manufacturer of the equipment is disclosed.
摘要翻译：本发明提供了虚拟机中的改进的安全性。通过扩展现代安全处理器的能力，计算的隐私由设备的所有者和在处理器上执行的其他用户提供，这是可出租，安全的计算机的有利特征。除了安装可虚拟化计算机所需的硬件扩展之外，还提供了用于部署这种处理器的基础设施。此外，公开了建立设备的所有者，用户和制造商之间的各种关系的信令流。

8. 发明申请

US20110010549A1 Efficient key management system and method 有权
标题翻译：高效的密钥管理系统和方法
公开(公告)号：US20110010549A1
公开(公告)日：2011-01-13
申请号：US12459717
申请日：2009-07-07
申请人： Vladimir Kolesnikov , Vijay Gurbani
发明人： Vladimir Kolesnikov , Vijay Gurbani
IPC分类号： H04L9/00
CPC分类号： H04L63/061 , H04L9/083 , H04L63/18 , H04L65/1006 , H04L65/105 , H04L2209/76
摘要： A system for providing cost effective, secure key exchange from at least one first device to at least one second device through at least one proxy server is provided. The system includes a first key exchange message from the at least one first device to the at least one second device via the at least one proxy server. A second key exchange message from the at least one second device to the at least one first device via a media stream of the Internet is required to complete the computation of the session key. A method of securing a communication system is also set forth. The method includes the steps of providing a routing device for identifying a subscriber, and providing a master key exchange session, the master key exchange session including a key k to find a subscriber and a nonce r to answer a query to the subscriber, wherein the master key exchange session includes both the key k and the nonce r.
摘要翻译：提供了一种用于通过至少一个代理服务器从至少一个第一设备到至少一个第二设备提供成本有效的安全密钥交换的系统。系统包括经由至少一个代理服务器从至少一个第一设备到至少一个第二设备的第一密钥交换消息。需要经由因特网的媒体流从至少一个第二设备到至少一个第一设备的第二密钥交换消息来完成会话密钥的计算。还阐述了确保通信系统的方法。该方法包括以下步骤：提供用于识别订户的路由设备，以及提供主密钥交换会话，所述主密钥交换会话包括查找订户的密钥k和用户应答查询的随机数，其中，主密钥交换会话包括密钥k和随机数。

9. 发明申请

US20090175443A1 Secure function evaluation techniques for circuits containing XOR gates with applications to universal circuits 有权
标题翻译：包含XOR门的电路的安全功能评估技术与通用电路的应用
公开(公告)号：US20090175443A1
公开(公告)日：2009-07-09
申请号：US12288919
申请日：2008-10-24
申请人： Vladimir Kolesnikov , Thomas Schneider
发明人： Vladimir Kolesnikov , Thomas Schneider
IPC分类号： H04L9/28 , H03K19/21 , H03K19/20
CPC分类号： H03K19/21 , H04L9/06 , H04L2209/12 , H04L2209/46
摘要： An embodiment of the present invention provides a method that minimizes the number of entries required in a garbled circuit associated with secure function evaluation of a given circuit. Exclusive OR (XOR) gates are evaluated in accordance with an embodiment of the present invention without the need of associated entries in the garbled table to yield minimal computational and communication effort. This improves the performance of SFE evaluation. Another embodiment of the present invention provides a method that replaces regular gates with more efficient constructions containing XOR gates in an implementation of a Universal Circuit, and circuits for integer addition and multiplication, thereby maximizing the performance improvement provided by the above.
摘要翻译：本发明的一个实施例提供了一种使与给定电路的安全功能评估相关联的乱码电路中所需的条目数目最小化的方法。根据本发明的实施例来评估异或（XOR）门，而不需要在乱码表中相关联的条目来产生最小的计算和通信努力。这提高了SFE评估的性能。本发明的另一实施例提供了一种在通用电路的实现中替换具有包含异或门的更有效构造的规则门的方法，以及用于整数加法和乘法的电路，从而最大化由上述提供的性能改进。

10. 发明授权

US09665353B2 Progressive rendering of data sets 有权
公开(公告)号：US09665353B2
公开(公告)日：2017-05-30
申请号：US13672495
申请日：2012-11-08
申请人： Vladimir Kolesnikov , Andrew Chien
发明人： Vladimir Kolesnikov , Andrew Chien
IPC分类号： G06F3/0482 , G06F9/44
CPC分类号： G06F8/38 , G06F3/0482
摘要： In one embodiment, a computing device identifies a first number of content objects to render for display along an axis within an area of a graphical user interface based on an assumed dimension of every content object and a maximum dimension of the area along the axis. The computing device renders the first number of content objects for display along the axis within the area, and determines a difference between the assume dimensions and actual dimensions of the rendered content objects along the axis. The computing device adjusts the assumed dimension based on the difference, and identifies a second number of content objects to render for display along the axis within the area based on the assumed dimension as adjusted and the maximum dimension of the area along the axis. And the computing device renders the second number of content objects for display along the axis within the area.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式