Verayo, Inc. Patent applications |
Patent application number | Title | Published |
20160127365 | AUTHENTICATION TOKEN - The disclosed invention is a system and method that allows for authentication of a user to a network using a token. The token interacts with a device and authenticates the user to the system using lower power consumption and minimal bandwidth user for communication. The token may be part of the device or stand alone. The various aspects of the present invention capture a novel design for an authentication token that eliminates the need for user interaction with the token. | 05-05-2016 |
20160127346 | MULTI-FACTOR AUTHENTICATION - The disclosed invention is a system and method that allows for authentication of a user to a network using a token. The user can use movements or gesture that are recorded by an accelerometer and the token interacts with a device and authenticates the user to the system. The token may be part of the device or stand alone. The various aspects of the present invention capture a novel design for an authentication token that authenticated the token and the user of the token. | 05-05-2016 |
20140331288 | ACCESS GATING OF NOISY PHYSICAL FUNCTIONS - A system and methods are disclosed that limiting the number of challenge/response pairs available to an adversary. In accordance with the various aspects of the present invention, gate the access to an authentication module with a gatekeeper. The system can create a challenge/response protocol whereby the amount of challenge/response information leaked is controlled by the server. The device cannot leak challenge/response pairs when the device is in the possession of or being queried by an adversary or false device. | 11-06-2014 |
20130298211 | AUTHENTICATION TOKEN - The disclosed invention is a system and method that allows for authentication of a user to a network using a token. The token interacts with a device and authenticates the user to the system. The token may be part of the device or stand alone. The various aspects of the present invention capture a novel design for an authentication token that eliminates the need for user interaction with the token. | 11-07-2013 |
20130010957 | CRYPTOGRAPHIC SECURITY USING FUZZY CREDENTIALS FOR DEVICE AND SERVER COMMUNICATIONS - An approach to cryptographic security uses a “fuzzy” credential, in contrast to a “hard” credential, to eliminate cryptographic algorithmic repeatability on a device that may be subject to physical attacks. By eliminating repeatability performed at an algorithmic (e.g., gate or software) level, a device inherently lacks one of the fundamental setup assumptions associated with certain classes of side channel, fault injection, timing, and related attacks, thus helps to protect the system against such attacks while preserving the cryptographic security of the system. | 01-10-2013 |
20120290845 | SOFT MESSAGE SIGNING - A message is signed using a PUF without having to exactly regenerate a cryptographic key. Another party that shares information about the PUF is able to verify the signature to a high degree of accuracy (i.e., high probability of rejection of a forged signature and a low probably of false rejection of a true signature). In some examples, the information shared by a recipient of a message signature includes a parametric model of operational characteristics of the PUF used to form the signature. | 11-15-2012 |
20120183135 | RELIABLE PUF VALUE GENERATION BY PATTERN MATCHING - A method is used to reliably provision and re-generate a finite and exact sequence of bits, for use with cryptographic applications, e.g., as a key, by employing one or more challengeable Physical Unclonable Function (PUF) circuit elements. The method reverses the conventional paradigm of using public challenges to generate secret PUF responses; it exposes the response and keeps the particular challenges that generate the response secret. | 07-19-2012 |
20110066670 | COMBINATION OF VALUES FROM A PSEUDO-RANDOM SOURCE - Values generated by at least one pseudo-random source (PRS) are recombined to form one or more recombined values. The method involves using analog, digital, or hybrid manipulation techniques to transform characteristics of PRS, including but not limited to statistical characteristics, and input/output characteristics. In some examples, the recombination method provides a way to de-bias output bits from PRS without appreciable increase in self noise. In some examples, the recombined result passes NIST's Statistical Tests for Randomness even if underlying PRS natively does not. In some examples, the recombination method provides a way to make a PRS challengeable, even if the underlying PRS is not natively challengeable. In some examples, recombination is used to allow single PRS to have multiple outputs, and in some cases multi-dimensional (orthogonal) outputs. In some examples, a multi-modal system is created via recombination using multiple PRS. In some examples, post recombined result exhibit super error characteristics (prior to application of any error correction codes) compared to native PRS output. In some examples, the recombined values are applied to security applications, for instance authentication and/or cryptographic functions, which may provide improved characteristics (e.g., cryptographic strength) in view of a de-biased output which in some examples also passes NIST's Statistical Tests. | 03-17-2011 |
20110033041 | INDEX-BASED CODING WITH A PSEUDO-RANDOM SOURCE - Outputs from at least one pseudo-random source are used to encode hidden value. The hidden value is encoded using index based quantities, for example, based on numerically ordering a sequence of outputs from pseudo-random source(s). In some examples, the numerical ordering of re-generated device-specific quantities is used to re-generate the hidden value, without necessarily requiring additional error correction mechanisms. Information leak may be reduced by constructing system whose “syndrome” helper bits are random, as measured, for example, by NIST's Statistical Tests for Randomness In some examples, index based coding provides coding gain that exponentially reduces total error correction code complexity, resulting in efficiently realizable PRS-based key generation systems. In some examples, index based coding allows noisy PRS to be robust across conditions where conventional error correction code cannot error correct. | 02-10-2011 |
20100272255 | SECURELY FIELD CONFIGURABLE DEVICE - A field configurable device, such as an FPGA, supports secure field configuration without using non-volatile storage for cryptographic keys on the device and without requiring a continuous or ongoing power source to maintain a volatile storage on the device. The approach can be used to secure the configuration data such that it can in general be used on a single or a selected set of devices and/or encryption of the configuration data so that the encrypted configuration data can be exposed without compromising information encoded in the configuration data. | 10-28-2010 |
20100127822 | NON-NETWORKED RFID-PUF AUTHENTICATION - An integrated circuit includes a sequence generator configured to generate a series of challenges; a hidden output generator configured to generate a series of hidden outputs, each hidden output a function of a corresponding challenge in the series of challenges; and bit reduction circuitry configured to generate a response sequence including a plurality of response parts, each response part a function of a corresponding plurality of hidden outputs. | 05-27-2010 |
20090254981 | Volatile Device Keys And Applications Thereof - A key is determined from a volatile response using circuitry on the device. The volatile response depend on process variation in fabrication of the device. Error control data that depends on the first volatile response can be computed, stored externally to the device, and then used to generate the key using a volatile response using the circuit. Applications of volatile keys include authentication and rights management for content and software. | 10-08-2009 |
20090083833 | AUTHENTICATION WITH PHYSICAL UNCLONABLE FUNCTIONS - Physical Unclonable Functions (PUFs) for authentication can be implemented in a variety of electronic devices including FPGAs, RFIDs, and ASICs. In some implementations, challenge-response pairs corresponding to individual PUFs can be enrolled and used to determine authentication data, which may be managed in a database. Later when a target object with a PUF is intended to be authenticated a set (or subset) of challenges are applied to each PUF device to authenticate it and thus distinguish it from others. In some examples, authentication is achieved without requiring complex cryptography circuitry implemented on the device. Furthermore, an authentication station does not necessarily have to be in communication with an authority holding the authentication data when a particular device is to be authenticated. | 03-26-2009 |