摘要:
Disclosed are methods for extracting and using information about an entity that has a presence in a number of information domains. The entity has separate identifiers in each of several domains. Various techniques are described that bind together the identifiers of the entity across the domains. The results of the binding are provided to an interested party that can review information extracted about the entity's behavior in the multiple domains. The interested party is not given access to information that would compromise the confidentiality of the entity. A trusted broker has access to information about the behavior of the entity in the several domains. The broker analyzes that information and provides the analysis to the interested party, again without compromising the confidentiality of the entity. An “incentivizer” works with the broker to extract from the domains information that would be useful in binding together the different identifiers of the entity.
摘要:
A “message broker” personalizes messages based on the recipient's estimated “privacy sensitivity.” By carefully estimating the sensitivity, the message broker can achieve the advantages of personalized messaging without incurring the disadvantages of offending or scaring away the recipient. In a first set of embodiments, messages are sent to a recipient, and information about the recipient's responses is collected and analyzed. The sensitivity level of the recipient is estimated based on this collected information. In a second set of embodiments, messages are sent that include an offer in which an incentive will be given to the recipient in exchange for allowing a certain type of access to specific information associated with the recipient. In a third set of embodiments, the message broker sends messages that request information associated with the recipient, but the messages do not include explicit offers to give incentives in exchange for the information.
摘要:
A “message broker” personalizes messages based on the recipient's estimated “privacy sensitivity.” By carefully estimating the sensitivity, the message broker can achieve the advantages of personalized messaging without incurring the disadvantages of offending or scaring away the recipient. In a first set of embodiments, messages are sent to a recipient, and information about the recipient's responses is collected and analyzed. The sensitivity level of the recipient is estimated based on this collected information. In a second set of embodiments, messages are sent that include an offer in which an incentive will be given to the recipient in exchange for allowing a certain type of access to specific information associated with the recipient. In a third set of embodiments, the message broker sends messages that request information associated with the recipient, but the messages do not include explicit offers to give incentives in exchange for the information.
摘要:
Disclosed are methods for extracting and using information about an entity that has a presence in a number of information domains. The entity has separate identifiers in each of several domains. Various techniques are described that bind together the identifiers of the entity across the domains. The results of the binding are provided to an interested party that can review information extracted about the entity's behavior in the multiple domains. The interested party is not given access to information that would compromise the confidentiality of the entity. A trusted broker has access to information about the behavior of the entity in the several domains. The broker analyzes that information and provides the analysis to the interested party, again without compromising the confidentiality of the entity. An “incentivizer” works with the broker to extract from the domains information that would be useful in binding together the different identifiers of the entity.
摘要:
Authentication is performed to a confidence level (CL) desired by a verifier (220). A prover (210) picks and sends certain same size, square matrices to the verifier (220). A random request bit is sent (234) from the verifier (220) to the prover (210) after the receipt of a certain square matrix. Depending on the request bit, calculations are made (244, 264) by the verifier (220) to determine if the matrices sent from the prover are verifiable. The prover (210) is iteratively authenticated by the verifier (220). Iterations are continued until (320) a count of the iterations (IL) reaches a number sufficient to achieve the desired confidence level (CL). After a delay, more iterations can achieve a higher confidence level by building on previous result of authentication without having to begin at zero. During this delay, the verifier (220) can perform tasks in reliance on the result of authentication. Digital logic can perform the authentication.
摘要:
The identity of a user of a mobile device is verified by the mobile device accessing the location of the mobile device over recent time to obtain a current route, comparing a feature of the current route to characteristic features of previous routes stored on the mobile device. The user is verified if the feature of the current route matches a characteristic feature of previous routes. The previous routes may be obtained by tracking the location of the mobile device over time to obtain a number of routes, identifying characteristic features of the routes, and storing the characteristic features of the routes.
摘要:
A method and system for secure call Dual-Tone Multi-Frequency (DTMF) signaling includes entering (202) dial string of a telephone number of a destination device, assigning (210, 212) the dial string to a predefined string having a total length that is greater than the dial string such that there will be at least one leading hexadecimal bit in the predefined string length that is not used when the entered dial string is converted to a hexadecimal, converting (214) the dial string to hexadecimal, reversing the order of the hexadecimal, and placing the reversed hexadecimal at the beginning of the predefined string, appending (216) “one” bits to the predefined string length indicating how many nibbles of the predefined string length are unused, if any, and appending the remaining intervening unused bits in the predefined string length to “zero” bits, and sending (226) the encoded string length.
摘要:
A method and system for secure call Dual-Tone Multi-Frequency (DTMF) signaling includes entering (202) dial string of a telephone number of a destination device, assigning (210, 212) the dial string to a predefined string having a total length that is greater than the dial string such that there will be at least one leading hexadecimal bit in the predefined string length that is not used when the entered dial string is converted to a hexadecimal, converting (214) the dial string to hexadecimal, reversing the order of the hexadecimal, and placing the reversed hexadecimal at the beginning of the predefined string, appending (216) “one” bits to the predefined string length indicating how many nibbles of the predefined string length are unused, if any, and appending the remaining intervening unused bits in the predefined string length to “zero” bits, and sending (226) the encoded string length.
摘要:
A method and apparatus for modifying a color of an electronics housing (104) based on the device security, authentication, and/or authorization is provided herein. During operation a device (100) will repeatedly gather a current security status and then modify a color or pattern of the housing based on the security status. Because the color of an electronics device indicates the current security, authentication, and/or authorization level, a user of the device can easily determine their security, authentication, and/or authorization level.
摘要:
Communication and validation of information transfer from a transmitter to a receiver is achieved by generating a cipher (400) from a message m (410) using parameters of an elliptic curve, a generator point P (406) on the elliptic curve and a public key Q (416) of the receiver. The cipher includes a first element that is the product kP of a random number k (404) with the generator point P and a second element that is the product of m and the x-coordinate of the product kQ. The message m is generated from two mathematically independent representations of the information and, optionally, a random number. The cipher is communicated to the receiver and decoded to recover a message m′ (502). A validation token (500) is generated by the receiver and passed to the transmitter, which validates communication of the information to the receiver if the product mkQ is equal to the validation token.