-
公开(公告)号：US06696779B2
公开(公告)日：2004-02-24
申请号：US10095831
申请日：2002-03-12
申请人： Pim Theo Tuyls
发明人： Pim Theo Tuyls
IPC分类号： H01J2970
CPC分类号： H01J29/76 , H01J2229/7031
摘要： The present invention relates to a yoke ring for use in a deflection unit in a cathode ray tube (CRT). The yoke ring having a neck and a flared side, and being defined by an inner and an outer contour. According to the invention, the inner contour is periodically deformed in the radial direction, the contour having at least two local minima and maxima. This deformation influences the magnetic field generated by the coils in the CRT, leading to improved front-of-screen performance. In particular, astigmatism, coma and raster errors are reduced.
摘要翻译： 本发明涉及一种用于阴极射线管（CRT）中的偏转单元的轭环。 轭环具有颈部和扩张侧，并且由内外轮廓限定。 根据本发明，内轮廓在径向上周期性变形，轮廓具有至少两个局部最小值和最大值。 这种变形影响CRT中线圈产生的磁场，从而提高了屏幕前的性能。 特别地，散光，昏迷和光栅错误减少。
-
公开(公告)号：US09276739B2
公开(公告)日：2016-03-01
申请号：US12305063
申请日：2007-06-29
申请人： Mehmet Utku Celik , Boris Skoric , Pim Theo Tuyls
发明人： Mehmet Utku Celik , Boris Skoric , Pim Theo Tuyls
CPC分类号： H04L9/085 , H04L9/0861 , H04L63/0478 , H04L2209/60
摘要： A method of encrypting data using a first key and multiple encryption keys at least in part based on the first key. The method includes encoding the data into a redundant representation by distributing the information content of the data among a number of groups, each group being associated with a respective encryption key of the multiple encryption keys, each encryption key being associated with at least one group, the redundant representation allowing recovery of the data in the absence of the groups associated with the at least one of the multiple encryption keys, and encrypting each group by the respective associated encryption key.
摘要翻译： 至少部分地基于第一密钥使用第一密钥和多个加密密钥加密数据的方法。 该方法包括通过在多个组中分配数据的信息内容来将数据编码为冗余表示，每个组与多个加密密钥的相应加密密钥相关联，每个加密密钥与至少一个组相关联， 所述冗余表示允许在不存在与所述多个加密密钥中的所述至少一个加密密钥相关联的组的情况下恢复数据，以及通过各自相关联的加密密钥加密每个组。
-
公开(公告)号：US09247024B2
公开(公告)日：2016-01-26
申请号：US12595671
申请日：2008-04-04
CPC分类号： H04L67/34 , G06F21/10 , H04L9/321 , H04L9/3278 , H04L63/08 , H04L63/10 , H04L67/12 , H04L2209/60 , H04L2209/80
摘要： A method of and system (110) for controlled activation of at least one function in a product or component at a remote location, which activation requires a correct activation data item to be available in the product or component. The method comprises receiving one or more noisy outputs of an unclonable element associated with the component from the remote location, and providing helper data to the remote location, which helper data transforms the one or more noisy outputs to a single value which corresponds to the correct activation data item.
摘要翻译： 一种用于受控激活远程位置的产品或组件中的至少一个功能的方法和系统（110），该激活需要在产品或组件中可用的正确的激活数据项。 该方法包括从远程位置接收与组件相关联的不可克隆元件的一个或多个噪声输出，以及向远程位置提供帮助数据，哪个帮助数据将一个或多个噪声输出转换成对应于正确的单个值 激活数据项。
-
公开(公告)号：US08819409B2
公开(公告)日：2014-08-26
申请号：US13501875
申请日：2010-10-20
申请人： Christiaan Kuipers , Pim Theo Tuyls
发明人： Christiaan Kuipers , Pim Theo Tuyls
CPC分类号： H04L9/3278 , G06F21/10 , G06F2221/0711 , G06F2221/0753 , G06F2221/0755 , H04L9/08 , H04L9/0866 , H04L9/32 , H04L9/3271 , H04L2209/34 , H04L2209/60 , H04L2209/80
摘要： A distribution system and method for distributing digital information is provided, which has high recoverability from a security breach. The distribution system comprises a server (200) and a computing device (110). During an enrollment phase, the computing device obtains a first response from an integrated physically unclonable function (150) integrated in the computing device. The system comprises an enrollment module (130) for determining helper data from a decryption key and the first response to enable later reconstruction of the decryption key from the helper data and a second response obtained from the physically unclonable function. During a reconstruction phase, which occurs after the enrollment phase and typically after a security breach has occurred that revealed data and/or programming code of the computing device, the server may encrypt digital information using an encryption module (220) with a cryptographic encryption key corresponding to the decryption key.
摘要翻译： 提供了一种用于分发数字信息的分发系统和方法，其具有从安全漏洞的高可恢复性。 分配系统包括服务器（200）和计算设备（110）。 在注册阶段，计算设备从集成在计算设备中的集成的物理上不可克隆功能（150）获得第一响应。 该系统包括用于从解密密钥确定帮助数据的登记模块（130）和用于能够从辅助数据稍后重建解密密钥的第一响应以及从物理不可克隆功能获得的第二响应。 在重建阶段期间，其在注册阶段之后发生，并且通常在发生了显示计算设备的数据和/或编程代码的安全漏洞之后，使用具有密码加密密钥的加密模块（220）来加密数字信息 对应于解密密钥。
-
公开(公告)号：US08775809B2
公开(公告)日：2014-07-08
申请号：US12515020
申请日：2007-11-12
IPC分类号： G06F21/00
CPC分类号： H04L9/3231 , H04L9/3247 , H04L2209/805
摘要： A method and a device of verifying the validity a digital signature based on biometric data. A verifier attains a first biometric template of the individual to be verified, for instance by having the individual provide her fingerprint via an appropriate sensor device. Then, the verifier receives a digital signature and a second biometric template. The verifier then verifies the digital signature by using either the first or the second biometric template as a public key. The attained (first) biometric template of the individual is compared with the received (second) biometric template associated with the signature and if a match occurs, the verifier can be confident that the digital signature and the associated (second) biometric template have not been manipulated by an attacker for impersonation purposes.
摘要翻译： 一种基于生物特征数据验证数字签名的有效性的方法和装置。 验证者获得要验证的个体的第一生物特征模板，例如通过使个体通过适当的传感器装置提供她的指纹。 然后，验证者接收数字签名和第二生物特征模板。 验证者然后通过使用第一或第二生物特征模板作为公钥来验证数字签名。 将获得的（第一）个体生物特征模板与与签名相关联的接收（第二）生物特征模板进行比较，并且如果匹配发生，验证者可以确信数字签名和相关联的（第二）生物测定模板尚未被 由攻击者为了冒充目的操纵。
-
46.发明申请公开(公告)号：US20100122093A1
公开(公告)日：2010-05-13
申请号：US11993724
申请日：2006-07-04
CPC分类号： G06F21/34 , G06F21/33 , G06F21/73 , G07C9/00007 , H04L9/321 , H04L9/3218 , H04L9/3221 , H04L9/3234 , H04L9/3278 , H04L2209/08 , H04L2209/805
摘要： The invention relates to a method for proving authenticity of a prover PRV to a verifier VER, the method comprising generating a secret S using a physical token by the prover PRV. Obtaining a public value PV by the verifier, where the public value PV has been derived from the secret S using a function for which the inverse of said function is computationally expensive. The method further comprising a step for conducting a zero knowledge protocol between the prover PRV and the verifier VER in order to prove to the verifier VER, with a pre-determined probability, that the prover PRV has access to the physical token, where the prover PRV makes use of the secret S and the verifier VER makes use of the public value PV. The invention further relates to a system employing the method, and an object for proving authenticity.
摘要翻译： 本发明涉及一种用于向验证者VER验证证明者PRV的真实性的方法，该方法包括使用证明者PRV使用物理令牌生成秘密S。 通过验证者获得公共价值PV，其中公共价值PV已经从秘密S导出，使用所述函数的倒数在计算上是昂贵的函数。 该方法还包括用于在证明者PRV和验证者VER之间进行零知识协议的步骤，以便以预先确定的概率向验证者VER证明证明者PRV可以访问物理令牌，其中证明者 PRV使用秘密S，验证者VER利用公共价值PV。 本发明还涉及采用该方法的系统和用于证明真实性的对象。
-
公开(公告)号：US20100054466A1
公开(公告)日：2010-03-04
申请号：US12515814
申请日：2007-11-26
申请人： Timothy Kerins , Klaus Kursawe , Pim Theo Tuyls
发明人： Timothy Kerins , Klaus Kursawe , Pim Theo Tuyls
CPC分类号： G06F7/588 , H04L9/0625 , H04L9/0631 , H04L9/0662 , H04L9/3278
摘要： The invention provides a method of generating arbitrary numbers given a seed, characterized by providing a challenge derived from the seed to a physical token, receiving an initial response from the physical token, combining the initial response with helper data associated with the challenge to produce a stable response, and generating the arbitrary numbers using a pseudo-random number generator using the stable response as a seed for the generator. Preferably one or more of these pseudo-random permutations are used as one or more round function(s) in a Feistel block cipher. The generated arbitrary numbers may also be used to create a cryptographic key.
摘要翻译： 本发明提供了一种产生给种子的任意数字的方法，其特征在于将从种子导出的挑战提供给物理标记，从物理标记接收初始响应，将初始响应与与挑战相关联的辅助数据组合以产生 稳定响应，并且使用使用稳定响应作为发生器的种子的伪随机数发生器来生成任意数。 优选地，这些伪随机排列中的一个或多个用作Feistel块密码中的一个或多个轮函数。 生成的任意数字也可以用于创建加密密钥。
-
公开(公告)号：US20100027784A1
公开(公告)日：2010-02-04
申请号：US11722443
申请日：2005-12-22
CPC分类号： G06F21/32 , H04L9/0866 , H04L9/32 , H04L9/3231 , H04L9/3236 , H04L63/061 , H04L63/0861
摘要： There is provided a method of generating a key for encrypting Communications between first and second terminals comprising obtaining a measurement of characteristics of a physical identifier of a user; and extracting a key from the physical identifier using a code selected from a collection of codes, each code in the collection defining an ordered mapping from a set of values of the characteristics to a set of keys; wherein the collection of codes comprises at least one code in which the ordered mapping is a permutation of the ordered mapping of one of the other codes in the collection.
摘要翻译： 提供了一种生成用于加密第一和第二终端之间的通信的密钥的方法，包括获得用户的物理标识符的特性的测量; 以及使用从代码集合中选择的代码从所述物理标识符提取密钥，所述集合中的每个代码从一组特征值定义到一组密钥的有序映射; 其中代码的收集包括至少一个代码，其中有序映射是集合中其他代码之一的有序映射的置换。
-
公开(公告)号：US20090217045A1
公开(公告)日：2009-08-27
申请号：US12095000
申请日：2006-11-27
申请人： Boris Skoric , Alphons Antonius Maria Lambertus Bruekers , Pim Theo Tuyls , Willem Gerard Ophey
发明人： Boris Skoric , Alphons Antonius Maria Lambertus Bruekers , Pim Theo Tuyls , Willem Gerard Ophey
IPC分类号： H04L9/32
CPC分类号： H04L9/3234 , H04L9/3278
摘要： The present invention relates to a method of creating challenge-response pairs, a method of authenticating a plurality of physical tokens, a system for creating challenge-response pairs and a device for authenticating a plurality of physical tokens. A basic idea of the invention is to interconnect a plurality of physical tokens (101, 102, 103), such as a plurality of uncloneable functions (PUFs), in a sequence, provide the sequence with a challenge (Q and use a response of a PUF as a challenge to a subsequent PUF in the sequence. When a final PUF is reached in the sequence and produces a response (R), a challenge-response pair (CRP) has been created, which pair comprises the challenge provided to the sequence of PUFs and the response produced by the final PUF. At least the challenge of this CRP is then stored.
摘要翻译： 本发明涉及创建挑战 - 响应对的方法，认证多个物理令牌的方法，用于创建挑战 - 响应对的系统和用于认证多个物理令牌的设备。 本发明的基本思想是在序列中互连多个物理令牌（101,102,103），诸如多个不可克隆的功能（PUF）），为序列提供挑战（Q并使用 PUF作为序列中随后的PUF的挑战当在序列中达到最终PUF并产生响应（R）时，创建了挑战 - 响应对（CRP），该对包括提供给 PUF序列和最终PUF产生的响应，至少存储了该CRP的挑战。
-
50.发明申请公开(公告)号：US20080314715A1
公开(公告)日：2008-12-25
申请号：US12097520
申请日：2006-11-29
IPC分类号： G07D7/00 , G06K19/067
CPC分类号： G07F7/12 , G06K19/0672 , G06K19/10 , G07D7/01 , G07F7/08
摘要： A security element comprises at least one oscillating circuit (O1-On) and a digital signature (2). Each oscillating circuit (O1-On) comprises a capacitor (C1-Cn) as resonance frequency setting element wherein the capacitor (C1-Cn) consists of two electrodes (8, 10) which are spaced apart from each other and a dielectric (9) that is sandwiched between the two electrodes (8, 10). The capacitor (C1-Cn) of each oscillating circuit has a random capacitance value which randomness is caused by a non-uniform thickness (d) of the dielectric (9) and/or by an inhomogeneous dielectric material. The digital signature (2) comprises reference values indicative for the resonance frequencies (f1-fh) of the oscillating circuits wherein the reference values are digitally signed with a secret key.
摘要翻译： 安全元件包括至少一个振荡电路（O1-On）和数字签名（2）。 每个振荡电路（O1-On）包括作为谐振频率设定元件的电容器（C1-Cn），其中电容器（C1-Cn）由彼此间隔开的两个电极（8,10）和电介质（9 ）夹在两个电极（8,10）之间。 每个振荡电路的电容器（C1-Cn）具有由电介质（9）的不均匀厚度（d）和/或不均匀电介质材料引起的随机电容值。 数字签名（2）包括指示振荡电路的谐振频率（f1-fh）的参考值，其中参考值用秘密密钥进行数字签名。
-
-
-
-
-
-
-
-
-
搜索结果
70 条记录 (耗时 0.025 秒)
