Abstract: Various techniques for detecting homographs of domain names are disclosed. In some embodiments, a system, process, and/or computer program product for detecting homographs of domain names includes receiving a DNS data stream, wherein the DNS data stream includes a DNS query and a DNS response for resolution of the DNS query; applying a homograph detector for each domain in the DNS data stream; and detecting a homograph of a domain name in the DNS data stream using the homograph detector.

Abstract: Various techniques for detecting homographs of domain names are disclosed. In some embodiments, a system, process, and/or computer program product for detecting homographs of domain names includes receiving a DNS data stream, wherein the DNS data stream includes a DNS query and a DNS response for resolution of the DNS query; applying a homograph detector for each domain in the DNS data stream; and detecting a homograph of a domain name in the DNS data stream using the homograph detector.

Abstract: Various techniques for detecting homographs of domain names are disclosed. In some embodiments, a system, process, and/or computer program product for detecting homographs of domain names includes receiving a DNS data stream, wherein the DNS data stream includes a DNS query and a DNS response for resolution of the DNS query; applying a homograph detector for each domain in the DNS data stream; and detecting a homograph of a domain name in the DNS data stream using the homograph detector.

Abstract: Various techniques for detecting homographs of domain names are disclosed. In some embodiments, a system, process, and/or computer program product for detecting homographs of domain names includes receiving a DNS data stream, wherein the DNS data stream includes a DNS query and a DNS response for resolution of the DNS query; applying a homograph detector for each domain in the DNS data stream; and detecting a homograph of a domain name in the DNS data stream using the homograph detector.

Abstract: Various techniques for detecting homographs of domain names are disclosed. In some embodiments, a system, process, and/or computer program product for detecting homographs of domain names includes receiving a DNS data stream, wherein the DNS data stream includes a DNS query and a DNS response for resolution of the DNS query; applying a homograph detector for each domain in the DNS data stream; and detecting a homograph of a domain name in the DNS data stream using the homograph detector.

Abstract: A system and method that enables a LBS provider to provide a location-based marketplace for third-party businesses to market or advertise location- and/or need-based offers to users while keeping the users' information confidential from both the LBS provider and the third party businesses is provided. While the LBS provider is able to identify a user, it cannot learn his/her needs. The third party businesses can learn the user needs, but not the identity of the users with the need. A business can compare its target location for a marketing/advertising campaign to the user's location, such that it can learn when a user is currently at a target location. However, the business will fail to learn the identity of a user in the target location, or any information about the user's current location when outside of the target location.

Abstract: Solutions that protect consumer location information yet still enable the use of such location information in the determination of fraud risk scores are provided. Cryptographic techniques of private information retrieval (PIR) and homomorphic encryption are used to protect consumer location information even as ii is used to enhance fraud risk scares. PIR is used to enable m issuer to retrieve non-specific location information using a consumer mobile number as the query criterion without needing to snare or disclose the mobile number with the service provider. Homomorphic encryption is used to protect location information of mobile consumers, while ensuring card issuers are only able to learn non-specific information about the location of the consumer.

Abstract: A secure perfect hash function that has properties similar to those of cryptographic hash functions without compromising features of a perfect hash function such as speed and collision-free outputs is provided. A cryptographic hash function is utilized to process the set S and the. output is divided into three sub-outputs of required length. Each output can now be treated as a separate hash function (g(x), f1(x), f2(x)), S is split into r buckets Bi, 0?i<r, using the hash function g. Buckets Bi are permuted in a pseudorandom fashion. For each bucket Bi, a displacement pair (d0, d1) is chosen randomly from the sequence {(0,0), (0,1), . . . (0, m?1), (1,,0),(1,1), . . . , (1, m?1), . . . ,(m?1, m?1)} such that each element of Bi is placed in an empty bin given by (f1(x)+d0f2(x)+d1) mod m. The index of this displacement is stored in the sequence.

Abstract: A system and method that allows two parties to find common records in their data sets without having to actually share the data sets with each other or a third party. Two primitives, perfect hash functions and public key cryptography, are combined in a unique way to obtain a secure and efficient private matching solution. Since the data that is exchanged is always encrypted during the match process, neither party reveals its data to the other party. This solution enables two parties to match sensitive data such as PII (Personally Identifiable Information) or PHI (Protected Health Information) without having to disclose the data to other or to any third party. One or both of the parties only learn of matching records without learning any information about the records that do not match.

Abstract: A system and method that allows two parties to find common records in their data sets without having to actually share the data sets with each other or a third party. Two primitives, perfect hash functions and public key cryptography, are combined in a unique way to obtain a secure and efficient private matching solution. Since the data that is exchanged is always encrypted during the match process, neither party reveals its data to the other party. This solution enables two parties to match sensitive data such as PII (Personally Identifiable Information) or PHI (Protected Health Information) without having to disclose the data to other or to any third party. One or both of the parties only learn of matching records without learning any information about the records that do not match.

Abstract: A system and method that allows a business to obtain statistics to measure the progress of a marketing campaign while maintaining the privacy of consumer information, is provided. Using Private Information Retrieval (PIR) and other cryptographic privacy enhancing technologies, the consumer can request actions and receive responses from the business. The requests and responses are kept private from the business using PIR. The marketing strategy is represented as a graph with nodes representing the consumer states and links representing allowed transitions. The consumer request contains information about the consumer's state in the business's marketing strategy so that only allowed responses are made to the consumer. The business can monitor the overall execution of the marketing plan but cannot see the states or transitions of individual customers or their actions, searches or responses.

Abstract: A system and methods to provide updates of an oblivious database that is based on an original database without compromising privacy guarantees, and without requiring a periodic downtime to re-initialize the database. According to embodiments of the present invention, update caches are provided at the random servers that are not emptied or sent to the oblivious database after every update in a predictable fashion. Instead, updates are made incrementally to the oblivious database in an order that is independent of how the original database is updated. Hence there is no way for the server to learn which record of the oblivious database corresponds to an updated block from the original database.

Abstract: A system and methods to provide updates of an oblivious database that is based on an original database without compromising privacy guarantees, and without requiring a periodic downtime to re-initialize the database. According to embodiments of the present invention, update caches are provided at the random servers that are not emptied or sent to the oblivious database after every update in a predictable fashion. Instead, updates are made incrementally to the oblivious database in an order that is independent of how the original database is updated. Hence there is no way for the server to learn which record of the oblivious database corresponds to an updated block from the original database.

Abstract: A system and methods that preserve the privacy of personal information of consumers as they seek to take advantage of offers advertised by sellers is provided. A seller can advertise services or benefits with some criteria prospective consumers must satisfy to qualify for such services or benefits. A consumer can make a statement that shows that he or she satisfies the criteria. The requesting party is able to verify the correctness of the statement without being able to learn any additional information about the value of the attributes contained in the statement, other than the information directly implied by the statement. A consumer can be enrolled for the benefit or service after a statement has been successfully verified.

Abstract: Systems and methods for utilizing a digital mailbox to provide additional services with regard to physical mail are provided. A more efficient process for verification of address uses a corresponding digital mailbox to first identify potentially misdirected mailpieces before incurring the expense of a third party address record search. Additionally the system provides notifications related to physical mailpieces using a digital mailbox.

Abstract: A method and system for maintaining the privacy of consumers wishing to make a purchase while enabling them to benefit from a group discount is provided. Consumers register with a service provider that maintains their personal information in private. When a consumer is interested in purchasing a product or patronizing a traditional “brick and mortar” establishment, the consumer provides information to the service provider regarding such interest. The service provider can query other registered consumers to determine if there are others that have a similar interest. Using the leverage of all the consumers that respond to the query, the service provider can negotiate with one or more merchants to provide some type of group offer, without having to disclose the consumers' personal information. Upon successful negotiation of a group offer, the consumers will be provided with the offer.