中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

92 records (took 0.02 seconds)

    Leakage resilient garbled circuit generation using reduced memory hardware token
    33.
    发明授权
    Leakage resilient garbled circuit generation using reduced memory hardware token 有权
    泄漏弹性乱码电路生成使用减少的内存硬件令牌

    公开(公告)号：US09401804B2

    公开(公告)日：2016-07-26

    申请号：US13242743

    申请日：2011-09-23

    Applicant: Vladimir Kolesnikov ,  Virendra Kumar

    Inventor： Vladimir Kolesnikov ,  Virendra Kumar

    IPC: H04L9/06 ,  H04L9/32 ,  H04L9/14 ,  H04L9/28

    CPC classification number: H04L9/0662 ,  H04L9/14 ,  H04L9/28 ,  H04L9/3249 ,  H04L2209/12 ,  H04L2209/127 ,  H04L2209/46

    Abstract: A garbled circuit is generated for a client in a leakage-resilient manner with a reduced memory requirement. The garbled circuit is used for secure function evaluation between the client and a server. The garbled circuit is generated with a reduced storage requirement by obtaining a token from the server; querying the token gate-by-gate, wherein for each gate of the garbled circuit, the token generates new wire garblings and stores them with the client using a Stream Cipher and interacts with the leakage-protected area to generate a garbled table for the gate; and receiving the garbled circuit from the token. The token comprises a leakage-protected area. The Stream Cipher is leakage-resilient and can be a symmetric-key cryptographic primitive that has a secret key as an input and generates an unbounded stream of pseudorandom bits as an output. The number of evaluations of the Stream Cipher is kept to a substantial minimum. For example, the Stream Cipher can execute with a same key only twice, such as only once for an encryption and only once for a decryption.

    Abstract translation: 以具有减少的存储器要求的泄漏弹性方式为客户端生成乱码电路。 乱码电路用于客户端和服务器之间的安全功能评估。 通过从服务器获取令牌来产生具有减少的存储要求的乱码电路; 逐个询问令牌，其中对于乱码电路的每个门令牌，令牌产生新的线加成，并且使用流密码与客户端一起存储它们，并与泄漏保护区域相互作用以产生用于门的乱码表 ; 并从令牌接收乱码电路。 该令牌包括一个泄漏保护区域。 流密码是泄漏弹性的，并且可以是具有秘密密钥作为输入的对称密钥加密原语，并且生成作为输出的伪随机比特的无界流。 流密码的评估数量保持在相当低的水平。 例如，流密码可以用相同的密钥执行两次，例如只有一次用于加密，并且仅一次用于解密。

    Leakage-Resilient Garbled Circuit Generation Using Reduced Memory Hardware Token
    35.
    发明申请
    Leakage-Resilient Garbled Circuit Generation Using Reduced Memory Hardware Token 有权
    使用减少内存硬件令牌的泄漏弹性电路生成

    公开(公告)号：US20120076302A1

    公开(公告)日：2012-03-29

    申请号：US13242743

    申请日：2011-09-23

    Applicant: Vladimir Kolesnikov ,  Virendra Kumar

    Inventor： Vladimir Kolesnikov ,  Virendra Kumar

    IPC: H04L9/28

    CPC classification number: H04L9/0662 ,  H04L9/14 ,  H04L9/28 ,  H04L9/3249 ,  H04L2209/12 ,  H04L2209/127 ,  H04L2209/46

    Abstract: A garbled circuit is generated for a client in a leakage-resilient manner with a reduced memory requirement. The garbled circuit is used for secure function evaluation between the client and a server. The garbled circuit is generated with a reduced storage requirement by obtaining a token from the server; querying the token gate-by-gate, wherein for each gate of the garbled circuit, the token generates new wire garblings and stores them with the client using a Stream Cipher and interacts with the leakage-protected area to generate a garbled table for the gate; and receiving the garbled circuit from the token. The token comprises a leakage-protected area. The Stream Cipher is leakage-resilient and can be a symmetric-key cryptographic primitive that has a secret key as an input and generates an unbounded stream of pseudorandom bits as an output. The number of evaluations of the Stream Cipher is kept to a substantial minimum.

    Abstract translation: 以具有减少的存储器要求的泄漏弹性方式为客户端生成乱码电路。 乱码电路用于客户端和服务器之间的安全功能评估。 通过从服务器获取令牌来产生具有减少的存储要求的乱码电路; 逐个询问令牌，其中对于乱码电路的每个门令牌，令牌产生新的线加成，并且使用流密码与客户端一起存储它们，并与泄漏保护区域相互作用以产生用于门的乱码表 ; 并从令牌接收乱码电路。 该令牌包括一个泄漏保护区域。 流密码是泄漏弹性的，并且可以是具有秘密密钥作为输入的对称密钥加密原语，并且生成作为输出的伪随机比特的无界流。 流密码的评估数量保持在相当低的水平。

    Solid dispersions of opioid antagonists
    36.
    发明授权
    Solid dispersions of opioid antagonists 有权
    阿片样物质拮抗剂的固体分散体

    公开(公告)号：US07914776B2

    公开(公告)日：2011-03-29

    申请号：US11543619

    申请日：2006-10-05

    Applicant: Virendra Kumar

    Inventor： Virendra Kumar

    IPC: A61K31/785 ,  C08F20/00

    CPC classification number: A61K31/445

    Abstract: Solid dispersions of stable, amorphous opioid antagonists, particularly [[2(S)-[[4(R)-(3-hydroxyphenyl)-3(R),4-dimethyl-piperidinyl]methyl]-1-oxo-3-phenylpropyl]amino]acetic acid, with improved water solubility and bioavailability are disclosed. Also disclosed are methods of preventing or treating a side effect associated with an opioid. In addition, methods of treating or preventing pain, ileus, and opioid bowel dysfunction are disclosed.

    Abstract translation: 稳定的无定形阿片样物质拮抗剂的固体分散体，特别是[[2（S） - [[4（R） - （3-羟基苯基）-3（R），4-二甲基 - 哌啶基]甲基] -1-氧代-3- 苯基丙基]氨基]乙酸，其具有改善的水溶性和生物利用度。 还公开了预防或治疗与阿片样物质相关的副作用的方法。 此外，公开了治疗或预防疼痛，肠梗阻和阿片样物质肠功能障碍的方法。

    SYSTEM AND METHOD FOR PROVIDING PROGRAM TRACKING INFORMATION
    37.
    发明申请
    SYSTEM AND METHOD FOR PROVIDING PROGRAM TRACKING INFORMATION 审中-公开
    提供程序跟踪信息的系统和方法

    公开(公告)号：US20110029819A1

    公开(公告)日：2011-02-03

    申请号：US12533625

    申请日：2009-07-31

    Applicant: Virendra Kumar Mehta ,  Xiaohua Zhang

    Inventor： Virendra Kumar Mehta ,  Xiaohua Zhang

    IPC: G06F11/07 ,  G06F9/45 ,  G06F11/36

    CPC classification number: G06F11/3644

    Abstract: There is provided a system and method of providing program tracking information. An exemplary method comprises compiling a program into a plurality of instruction bundles. The exemplary method also comprises placing an instruction to store program tracking information in a local path table or a global path table into at least one of the plurality of instruction bundles.

    Abstract translation: 提供了一种提供节目跟踪信息的系统和方法。 一种示例性方法包括将程序编译成多个指令束。 该示例性方法还包括将本地路径表或全局路径表中的程序跟踪信息存储到多个指令束中的至少一个中的指令。

    Handling caught exceptions
    38.
    发明授权
    Handling caught exceptions 有权
    处理捕获异常

    公开(公告)号：US07877740B2

    公开(公告)日：2011-01-25

    申请号：US11152466

    申请日：2005-06-13

    Applicant: Virendra Kumar Mehta

    Inventor： Virendra Kumar Mehta

    IPC: G06F9/45

    CPC classification number: G06F9/4812 ,  G06F2209/481

    Abstract: Embodiments of the invention relate to exceptions. In a Java embodiment, if the count of a program statement that causes the exception reaches a threshold, then the Java Virtual Machine (JVM) searches for the throw statement corresponding to that program statement. The JVM then identifies the catch clause corresponding to the throw statement, and depending on implementations, the JVM may replace the throw statement with the catch block or replace the throw statement with a jump to the catch block. As a result, in both situations, program execution, when being supposed to execute the throw statement, executes instructions of the catch block, and avoids execution of the throw statement that would invoke the exception handler, which improves system performance.

    Abstract translation: 本发明的实施例涉及例外。 在Java实施例中，如果导致异常的程序语句的计数达到阈值，则Java虚拟机（JVM）将搜索与该程序语句相对应的throw语句。 JVM然后识别与throw语句对应的catch子句，并且根据实现，JVM可以使用catch块替换throw语句，或者通过跳转到catch块来替换throw语句。 因此，在这两种情况下，程序执行时，当执行throw语句时，执行catch块的指令，避免执行调用异常处理程序的throw语句，从而提高系统性能。

    System and method for recompiling code based on locality domain and thread affinity in NUMA computer systems
    39.
    发明申请
    System and method for recompiling code based on locality domain and thread affinity in NUMA computer systems 有权
    在NUMA计算机系统中，根据局部域和线程关系重新编译代码的系统和方法

    公开(公告)号：US20080028179A1

    公开(公告)日：2008-01-31

    申请号：US11812639

    申请日：2007-06-20

    Applicant: Sandya S. Mannarswamy ,  Virendra Kumar Mehta ,  Prakash Sathyanath Raghavendra

    Inventor： Sandya S. Mannarswamy ,  Virendra Kumar Mehta ,  Prakash Sathyanath Raghavendra

    IPC: G06F12/00

    CPC classification number: G06F8/4442

    Abstract: A technique for reducing non-local access, in dynamically generated code that resides in a code buffer of a NUMA computer system including multiple nodes, for improving overall performance of dynamic optimization systems. In one example embodiment, this is accomplished by partitioning the code buffer into multiple smaller code buffers and assigning each of the multiple smaller code buffers to one of the multiple nodes. Statically determining which methods in the generated code are executed by a thread and then to place those methods in associated one of the multiple smaller code buffers to reduce memory latencies introduced by non-local accesses.

    Abstract translation: 一种在动态生成的代码中减少非本地访问的技术，该代码位于包含多个节点的NUMA计算机系统的代码缓冲区中，以改善动态优化系统的整体性能。 在一个示例实施例中，这是通过将代码缓冲器分成多个较小的代码缓冲器并将多个较小代码缓冲器中的每一个分配给多个节点之一来实现的。 静态确定生成的代码中的哪些方法由线程执行，然后将这些方法放置在多个较小代码缓冲器中的相关联的一个中，以减少非本地访问引入的内存延迟。

    Single step process for the preparation of lower α-alkene polymerization heterogeneous solid catalyst
    40.
    发明授权
    Single step process for the preparation of lower α-alkene polymerization heterogeneous solid catalyst 有权
    用于制备低级α-烯烃聚合异相固体催化剂的单步法

    公开(公告)号：US07265074B2

    公开(公告)日：2007-09-04

    申请号：US10552217

    申请日：2003-04-10

    Applicant: Sumit Bhaduri ,  Virendra Kumar Gupta ,  Krishna Sarma

    Inventor： Sumit Bhaduri ,  Virendra Kumar Gupta ,  Krishna Sarma

    IPC: C08F4/626 ,  C08F4/64

    CPC classification number: C08F110/00 ,  C08F110/02 ,  C08F110/06 ,  C08F4/651 ,  C08F4/654

    Abstract: Single step process for the preparation of lower α-alkene polymerisation heterogeneous solid catalyst, wherein the procatalyst is obtained by reacting organomagnesium precursor and titanium tetrahalide or titanium haloalkoxo species of the formula Ti(OR)m Xn, with a hydrocarbon or halohydrocarbon solvent and internal electron donor and optionally an acid halide under microwave irradiation of 300 to 1200 W. The mole ratio of the organomagnesium precursor to the titanium tetrachloride or titanium haloalko species is 1:6 to 1:20 and the mole ratios of the electron donor and acid halide to titanium is 0.3 to 1.5 and 0.02 to 0.2, respectively.

    Abstract translation: 用于制备低级α-烯烃聚合异相固体催化剂的单步法，其中通过有机镁前体和式Ti（OR）m Xn的四卤化钛或卤代烷氧基钛与烃或卤代烃溶剂和内部 电子给体和任选的酰卤，在微波辐射下为300〜1200W。有机镁前体与四氯化钛或钛卤代烷烃的摩尔比为1:6〜1:20，电子给体和酰卤的摩尔比 钛分别为0.3〜1.5,0.02〜0.2。

Patent Agency Ranking