71 results about "K-anonymity" patented technology

End-to-end user anonymity is provided in electronic commerce or other types of online transactions through the use of an intermediary. An intermediary machine, which may be implemented in the form of a set of servers or other type of computer system, receives communications from a consumer or other user, and generates and maintains an alias for that user. Connections between the user machine and any online vendor or other web site are implemented through the intermediary using the alias. When the user desires to make a purchase from a given online vendor, the intermediary may present the user with a number of options. For example, the user may be permitted to select a particular payment card number and real destination address as previously provided to the intermediary. The intermediary then communicates with the online vendor and supplies intermediary payment information, e.g., a payment card number associated with the intermediary rather than the user, along with appropriate authorizing information and an alias destination address, e.g., a third party physical shipping address for deliverable goods, an alias electronic address for downloadable material, etc. The online vendor charges the purchase to the intermediary, and redirects the delivery of the goods or services to the destination address provided by the intermediary. The intermediary charges the payment card number of the user, and arranges for the redirection of the delivery to the real user address. In this manner, the invention provides complete end-to-end anonymity for the user, even when the user desires to enter transactions involving purchase and receipt of deliverable goods and services.

The invention discloses a high-efficiency difference disturbance location privacy protection system and a method, considering that the attacker has the challenge to the location privacy protection method based on the location disturbance and fuzzy technology about the background knowledge of the user side information, the difference privacy protection technology is guided to the location fuzzy privacy protection method, the Hilbert space filling curve capable of self-adaption transition on the user location according to the distributed change features in the geographic space of the mobile user and the current fashionable quadtree or R tree spatial index are used for forming the location index for all mobile users in the geographic space, and the K anonymity contact area satisfying the principle of reciprocity is effectively generated. Then, the difference privacy protection technology is used for generating the location disturbance point reasonable near user real location of k location points of the contact area as the query location of LBS user for requesting service from the LBS service provider, the problems and deficiencies of the existing method can be overcome.

The invention relates to a user privacy protection method based on a secure smart contract k-anonymity incentive mechanism. According to the method, contracts are divided into public contracts and private contracts, the private contracts can be seen only by users in an anonymous group, the public contracts are encrypted through group keys to be prevented from being viewed by outsiders, and the private contracts and the public contracts are jointly verified, such that the security when the users request service is effectively guaranteed. According to the invention, the users can be encouraged to join the k-anonymous group and apply decentralized smart contracts such that potential security risks in a trusted center can be avoided; a part of information of the public contracts is encrypted by use of the group keys so that transaction relations are hidden; and joint verification is carried out by use of the private contracts and the public contracts and group verification is performed by use of a blind group signature such that the k-anonymous success rate is improved while the security is guaranteed.

A system and computer program product for transforming a Linked Data graph into a corresponding anonymous Linked Data graph, in which semantics is preserved and links can be followed to expand the anonymous graph up to r times without breaching anonymity (i.e., anonymity under r-dereferenceability). Anonymizing a Linked Data graph under r-dereferenceability provides privacy guarantees of k-anonymity or l-diversity variants, while taking into account and preserving the rich semantics of the graph.

A privacy-preserving location monitoring system is provided, comprising monitoring hosts and a server. Immense resource requirement in large-scale location monitoring is lessened by allowing peripheral devices of users to bond to only one host. A peripheral device's one or more identity resolving keys (IRKs) retrieved by the host are sent to the server so as to register the IRKs to the server. The server propagates the IRKs to all other hosts. Furthermore, each host only stores the IRKs of peripheral devices frequently visiting the host. An incoming IRK not known by the host is sent to the server for resolving an identity of a peripheral device sending this IRK. The system is implementable in Bluetooth Low Energy (BLE) technology. Based on privacy features of BLU, different privacy protection mechanisms, including opt-in / out, k-anonymity and granularity-based anonymity, are provided.

The invention relates to a cache decision method for privacy protection of named data network based on k-anonymity. The cache decision is only made at a node where a user sends a request, and a neighboring node to which the cache is to be cached is determined by the cache replacement rate of the node. Even if an attacker can know that someone has accessed the content recently, the attacker can notinfer which user accessed the content recently through which router because of the caching cooperation in the area, so the attacker can avoid detecting the privacy information of the requester, and the privacy of the requester can be effectively protected. Furthermore, the cache privacy is protected by extending the user anonymous area through neighbor cooperative caching. The router does not need to construct the anonymous area, and does not need to search the data in the anonymous area, which reduces the implementation difficulty of the anonymous area and the time delay for local users to obtain the data.