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

91. 发明授权

US08402439B2 Program analysis as constraint solving 有权
标题翻译：程序分析作为约束求解
公开(公告)号：US08402439B2
公开(公告)日：2013-03-19
申请号：US12147908
申请日：2008-06-27
申请人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
发明人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
IPC分类号： G06F9/44
CPC分类号： G06F8/49
摘要： Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
摘要翻译：描述了一种技术，程序分析使用丰富的不变模板，可以为程序验证指定线性不等式的任意布尔组合。还描述了选择一个标识程序位置的剪辑，每个程序位置与不变模板相关联。验证产生二阶约束，将基于这些约束的二阶逻辑公式转换为一阶逻辑公式，然后将一阶逻辑公式转换为无量词的公式，然后将其转换为布尔可满足公式。现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定，适用于终止分析，时序界限分析，以及针对终端和安全属性生成大多数一般的反例。

92. 发明授权

US08171306B2 Universal secure token for obfuscation and tamper resistance 有权
标题翻译：用于混淆和防篡改的通用安全令牌
公开(公告)号：US08171306B2
公开(公告)日：2012-05-01
申请号：US12265197
申请日：2008-11-05
申请人： Ramarathnam Venkatesan , Vipul Goyal
发明人： Ramarathnam Venkatesan , Vipul Goyal
IPC分类号： G06F21/00
CPC分类号： G06F21/14 , H04L9/3234 , H04L9/3242 , H04L2209/16
摘要： Program obfuscation is accomplished with tamper proof token including an embedded oracle. A public obfuscation function can be applied to any program/circuit to produce a new obfuscated program/circuit that makes calls to the corresponding oracle to facilitate program execution. A universal circuit representation can be employ with respect to obfuscation to hide circuit wiring and allow the whole circuit to be public. Furthermore, the token or embedded oracle can be universal and stateless to enable a single token to be employed with respect to many programs.
摘要翻译：程序模糊化是通过包含嵌入式oracle的防篡改令牌完成的。公共混淆函数可以应用于任何程序/电路，以产生一个新的混淆程序/电路，调用相应的oracle来促进程序的执行。可以采用通用电路表示来进行混淆以隐藏电路布线并允许整个电路公开。此外，令牌或嵌入式oracle可以是普遍的和无状态的，以使得能够针对许多程序使用单个令牌。

93. 发明授权

US07941726B2 Low dimensional spectral concentration codes and direct list decoding 有权
标题翻译：低维频谱浓度码和直接列表解码
公开(公告)号：US07941726B2
公开(公告)日：2011-05-10
申请号：US11772049
申请日：2007-06-29
申请人： Ramarathnam Venkatesan , Adi Akavia
发明人： Ramarathnam Venkatesan , Adi Akavia
IPC分类号： H03M7/00 , H03M13/05
CPC分类号： H03M13/3746 , H03M13/45 , H03M13/63
摘要： Systems and methods provide an optionally keyed error-correcting code that is spectrally concentrated. Each codeword of the low dimensional spectral concentration code (LDSC code) typically has very few coefficients of large magnitude and can be constructed even with limited processing resources. Decoding can be performed on low power devices. Error-correcting code is constructed around a key using basic computer arithmetic for computations instead of finite field arithmetic, thus saving energy. A recipient who possesses the key enjoys correction of a relatively high percentage of noise errors. In one implementation, a direct list-decoder iteratively estimates a list of message words directly, instead of a list of codewords. In variations, a unique message word is selected from the list either by applying a randomness test or by using message passing.
摘要翻译：系统和方法提供了光谱集中的可选密钥纠错码。低维频谱浓度码（LDSC码）的每个码字通常具有非常少的大幅度系数，并且甚至可以在有限的处理资源的情况下构造。可以在低功耗设备上进行解码。使用计算的基本计算机算术而不是有限域算术来构造纠错码，从而节省能量。具有密钥的接收者可以修正相对较高百分比的噪声误差。在一个实现中，直接列表解码器直接迭代地估计消息字列表，而不是码字列表。在变体中，通过应用随机性测试或使用消息传递从列表中选择唯一的消息字。

94. 发明申请

US20100228809A1 Randomized Signal Transforms and Their Applications 失效
标题翻译：随机信号变换及其应用
公开(公告)号：US20100228809A1
公开(公告)日：2010-09-09
申请号：US12782647
申请日：2010-05-18
申请人： Ramarathnam Venkatesan , Michael T. Malkin
发明人： Ramarathnam Venkatesan , Michael T. Malkin
IPC分类号： G06F17/14 , G06F7/72 , H04L1/00 , H04L9/32 , G06F7/58
CPC分类号： H04N7/167 , H04N21/8358
摘要： Techniques are disclosed to provide randomized signal transforms and/or their applications. More particularly, a signal (e.g., an audio signal, an image, or a video signal) is transformed by applying randomly-selected basis functions to the signal. The applications of the randomized signal transforms include, but are not limited to, compression, denoising, hashing, identification, authentication, and data embedding (e.g., watermarking).
摘要翻译：公开了提供随机信号变换和/或其应用的技术。更具体地，通过对信号应用随机选择的基函数来变换信号（例如，音频信号，图像或视频信号）。随机信号变换的应用包括但不限于压缩，去噪，散列，识别，认证和数据嵌入（例如，水印）。

95. 发明授权

US07770014B2 Randomized signal transforms and their applications 有权
标题翻译：随机信号变换及其应用
公开(公告)号：US07770014B2
公开(公告)日：2010-08-03
申请号：US10837563
申请日：2004-04-30
申请人： Ramarathnam Venkatesan , Michael T. Malkin
发明人： Ramarathnam Venkatesan , Michael T. Malkin
IPC分类号： H04L9/32
CPC分类号： H04N7/167 , H04N21/8358
摘要： Techniques are disclosed to provide randomized signal transforms and/or their applications. More particularly, a signal (e.g., an audio signal, an image, or a video signal) is transformed by applying randomly-selected basis functions to the signal. The applications of the randomized signal transforms include, but are not limited to, compression, denoising, hashing, identification, authentication, and data embedding (e.g., watermarking).
摘要翻译：公开了提供随机信号变换和/或其应用的技术。更具体地，通过对信号应用随机选择的基函数来变换信号（例如，音频信号，图像或视频信号）。随机信号变换的应用包括但不限于压缩，去噪，散列，识别，认证和数据嵌入（例如，水印）。

96. 发明授权

US07730315B2 Cryptosystem based on a Jacobian of a curve 失效
标题翻译：基于雅可比曲线的加密系统
公开(公告)号：US07730315B2
公开(公告)日：2010-06-01
申请号：US11275215
申请日：2005-12-19
申请人： Kristin E. Lauter , Peter L. Montgomery , Ramarathnam Venkatesan
发明人： Kristin E. Lauter , Peter L. Montgomery , Ramarathnam Venkatesan
IPC分类号： H04L9/00
CPC分类号： H04L9/302 , H04L9/32 , H04L2209/20 , H04L2209/30
摘要： A cryptosystem has a secret based on an order of a group of points on a Jacobian of a curve. In certain embodiments, the cryptosystem is used to generate a product identifier corresponding to a particular product. The product identifier is generated by initially receiving a value associated with a copy (or copies) of a product. The received value is padded using a recognizable pattern, and the padded value is converted to a number represented by a particular number of bits. The number is then converted to an element of the Jacobian of the curve, and the element is then raised to a particular power. The result of raising the element to the particular power is then compressed and output as the product identifier. Subsequently, the encryption process can be reversed and the decrypted value used to indicate validity and/or authenticity of the product identifier.
摘要翻译：密码系统具有基于曲线雅可比的一组点的顺序的秘密。在某些实施例中，密码系统用于生成对应于特定产品的产品标识符。产品标识符是通过初始接收与产品的副本（或副本）相关联的值来生成的。使用可识别的图案填充接收的值，并且将填充值转换为由特定位数表示的数字。然后将该数字转换为曲线的雅可比元素，然后将元素升高到特定的功率。然后将元件升高到特定功率的结果被压缩并作为产品标识符输出。随后，可以反转加密处理，并且解密的值用于指示产品标识符的有效性和/或真实性。

97. 发明申请

US20100107245A1 TAMPER-TOLERANT PROGRAMS 审中-公开
标题翻译：防篡改计划
公开(公告)号：US20100107245A1
公开(公告)日：2010-04-29
申请号：US12260581
申请日：2008-10-29
申请人： Mariusz H. Jakubowski , Chit Wei Saw , Ramarathnam Venkatesan
发明人： Mariusz H. Jakubowski , Chit Wei Saw , Ramarathnam Venkatesan
IPC分类号： G06F11/00
CPC分类号： G06F21/52
摘要： Tamper-tolerant programs enable correct and continued execution despite attacks. Programs can be transformed into tamper-tolerant versions that correct effects of tampering in response to detection thereof Tamper-tolerant programs can execute alone or in conjunction with tamper resistance/prevention mechanisms such as obfuscation and encryption/decryption, among other things. In fact, the same and/or similar mechanisms can be employed to protect tamper tolerance functionality.
摘要翻译：防篡改程序可以正确和持续执行，尽管发生攻击。可以将程序转换成防篡改版本，以纠正篡改对于检测的影响。防篡改程序可以单独执行，也可以与诸如混淆和加密/解密之类的防篡改/预防机制一起执行。事实上，可以采用相同和/或类似的机制来保护篡改容忍功能。

98. 发明授权

US07657752B2 Digital signal watermaker 失效
标题翻译：数字信号水印
公开(公告)号：US07657752B2
公开(公告)日：2010-02-02
申请号：US10980907
申请日：2004-11-04
申请人： M. Kivanc Mihcak , Ramarathnam Venkatesan
发明人： M. Kivanc Mihcak , Ramarathnam Venkatesan
IPC分类号： H04L9/00
CPC分类号： G10H1/0058 , G06F17/30026 , G06F17/30743 , G06F17/30758
摘要： Described herein is a technology for facilitating the watermarking of digital signals. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.
摘要翻译：这里描述了一种便于数字信号水印化的技术。本摘要本身并不旨在限制本专利的范围。在所附权利要求中指出了本发明的范围。

99. 发明申请

US20090326907A1 PROGRAM ANALYSIS AS CONSTRAINT SOLVING 有权
标题翻译：程序分析作为约束解
公开(公告)号：US20090326907A1
公开(公告)日：2009-12-31
申请号：US12147908
申请日：2008-06-27
申请人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
发明人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
IPC分类号： G06F9/45 , G06F7/60
CPC分类号： G06F8/49
摘要： Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
摘要翻译：描述了一种技术，程序分析使用丰富的不变模板，可以为程序验证指定线性不等式的任意布尔组合。还描述了选择一个标识程序位置的剪辑，每个程序位置与不变模板相关联。验证产生二阶约束，将基于这些约束的二阶逻辑公式转换为一阶逻辑公式，然后将一阶逻辑公式转换为无量词的公式，然后将其转换为布尔可满足公式。现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定，适用于终止分析，时序界限分析，以及针对终端和安全属性生成大多数一般的反例。

100. 发明申请

US20080320056A1 FUNCTION MATCHING IN BINARIES 失效
标题翻译：功能匹配在二进制
公开(公告)号：US20080320056A1
公开(公告)日：2008-12-25
申请号：US11767364
申请日：2007-06-22
申请人： Harish Mohanan , Perraju Bendapudi , Abishek Kumarasubramanian , Rajesh Jalan , Ramarathnam Venkatesan
发明人： Harish Mohanan , Perraju Bendapudi , Abishek Kumarasubramanian , Rajesh Jalan , Ramarathnam Venkatesan
IPC分类号： G06F17/30
CPC分类号： G06F11/3672 , G06F21/16
摘要： Which target functions in a target binary have target function basic blocks that match the source function basic blocks in a source function in a source binary is determined. For the target functions having matching target function basic blocks, a target function control flow graph is determined that has the greatest control flow matching strength to a source function control flow graph, wherein a node in the source function control graph represents a source function basic block, wherein a node in a target function control graph represents a target function basic block in a corresponding target function.
摘要翻译：确定目标二进制中的目标函数具有与源二进制中的源函数中的源函数基本块匹配的目标函数基本块。对于具有匹配的目标函数基本块的目标函数，确定对源函数控制流图具有最大控制流匹配强度的目标函数控制流程图，其中源函数控制图中的节点表示源函数基本块其中，目标函数控制图中的节点表示对应目标函数中的目标函数基本块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式