Patent Application
20170310629
The present disclosure relates to technology configured to facilitate reversed privacy settings in a network.
Over the last decade or so, communications via online communities, for example, a social network or the like, are becoming increasingly popular. Users of social networks communicate with those with whom they share an affinity, by sharing comments, observations, pictures etc. In current social networks, a user can indicate user preferences and restrictions on who can view user posts. Yet, there is no way for a particular user of a social network to specify or control posts by other users of the social network that reference or involve the particular user. For example, take a scenario where user may be in a photograph that a friend provides to others in his or her social group and someone in that group tags it, communicating it to yet others. As another example scenario, a user's friend may communicate to others a list of invitees or attendees to a party, which the user may wish to keep private.
In one innovative aspect, the present disclosure of the technology includes a system including a processor and memory including instructions that, when executed, cause the system to: receive social content from a particular user within a network; determine at least one user identified in the social content; evaluate an indication by the particular user to provide the social content to other users in the network; determine user restrictions designated by the identified user to indicate user preferences and consider the user preferences in relation to the social content before providing the social content to other users in the network further to the indication by the particular user; and execute visibility of the social content based on the user restrictions designated by the identified user for the social content.
In general, another innovative aspect of the present disclosure includes a method, using at least one computing device, for receiving social content from a particular user within a network; determining at least one user identified in the social content; evaluating an indication by the particular user to provide the social content to other users in the network; determining user restrictions designated by the identified user to indicate user preferences and considering the user preferences in relation to the social content before providing the social content to other users in the network further to the indication by the particular user; and executing visibility of the social content based on the user restrictions designated by the identified user for the social content.
Other implementations of one or more of these aspects include corresponding systems, apparatus, and computer programs, configured to perform the action of the methods, encoded on computer storage devices. These and other implementations may each optionally include one or more of the following features.
For instance, the operations further include: restricting viewing of the social content by others within the network and outside the network according to preferences, wherein the social content may be a post, a comment on the post, a friend list, or an invitation list.
For instance, the features include: user restrictions for restricting viewing of social content by others within the network and outside the network, wherein the social content may be a post, a comment on the post, a friend list, or an invitation list.
The systems and methods disclosed below are advantageous in a number of respects. With the ongoing trends and growth in social networks, it may be beneficial for a network, for example, a social network, to factor in preferences of people who are involved in social content (for example, photographs etc.) provided by users of a social network. The systems and methods described here better protects user privacy by protecting, not only the social content created or transmitted by the user to others, but the privacy of those who appear in the social content that is freely transmitted without consent of those who appear in the social content.
The present disclosure is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings, in which like reference numerals are used to refer to similar elements.
In some implementations, this technology includes systems and methods configured to determine and control social content visibility based on the permission settings of the one or more users of a network. As one example, certain users may want to either limit or restrict display of their social content, for example, photographs or other visual content to others within the network and outside the network. Hence, those involved in particular social content (for example, those who appear in a photograph and are “tagged,” by which action the photograph would be sent to all those tagged) may specify in the network that they want to limit or restrict flow and display of photographs that include them. The systems and methods protect users' information (included in other users' posts) in several ways. For example, a first user posts a photograph including a second user. The first user “tags” the second user (along with others in the photograph) in the photograph and the first user shares the photograph with his/her friends. However, the second user may not want the friends of the first user (except common friends) to see him or her in the photograph or his or her name tagged on the photograph.
As another example, a first user initiates an event and invites a second user among others. The first user specifies who can view the invitation list. However, the second user may not want others to see his or her name and response to this invitation (revealing the second user's intentions and whereabouts).
As yet another example, a second user may be included in a first user's “friend” list. The first user may be inclined to freely make his or her profile public. Yet, the second user may not want others to know that the second user is in the first user's “friend” list.
As yet another example, a second user may be included in a first user's “friend” list. The first user may elect to make his or her profile public, may be active in social networks, and may frequently comment on the second user's posts. However, the second user may not want the public to see the first user's comments to the second user's posts. Therefore, the present technology is configured to permit users to specify their privacy preferences relating to social content that involves or includes them, which are considered and executed by the systems and methods in the flow of the social content within the network and outside the network if routed from within the network.
Moreover, while the present disclosure is described below primarily in the context of providing a framework for controlling visibility of social content, the present disclosure may be applicable to other situations. For ease of understanding and brevity, the present disclosure is described in reference to determining and controlling visibility of social content within a social network and in instances where the social content is forwarded or transmitted from within the network to others outside the network.
The user devices 115a through 115n in
In some implementations, the social network server 102a may be coupled to the network 105 via a signal line 110. The social network server 102a includes a social network application 104, which includes the software routines and instructions to operate the social network server 102a and its functions and operations. Although only one social network server 102a is described here, multiple servers may be present, as illustrated by social network servers 102b through 102n, each with functionality similar to the social network server 102a, or different.
In some implementations, the social network server 102a may be coupled to the network 105 via a signal line 110. The social network server 102a includes a social network application 104, which includes the software routines and instructions to operate the social network server 102a and its functions and operations. Although only one social network server 102a is described here, multiple servers may be present, as illustrated by social network servers 102b through 102n, each with functionality similar to social network server 102a or different.
The term “social network” as used here includes, but is not limited to, a type of social structure where the users are connected by a common feature or link. The common feature includes relationships/connections, e.g., friendship, family, work, a similar interest, etc. The common features are provided by one or more social networking systems, for example those included in the system 100, including explicitly-defined relationships and relationships implied by social connections with other online users, where the relationships form the social graph 108.
The term “social graph” as used here includes, but is not limited to, a set of online relationships between users, for example provided by one or more social networking systems, for example the social network system 100, including explicitly-defined relationships and relationships implied by social connections with other online users, where the relationships form a social graph 108. In some examples, the social graph 108 may reflect a mapping of these users and how they are related to one another.
The social network server 102a and the social network application 104 as illustrated are representative of a single social network. Each of the plurality of social network servers 102a, 102b through 102n, may be coupled to the network 105, each having its own server, application, and social graph. For example, a first social network hosted on a social network server 102a may be directed to business networking, a second on a social network server 102b directed to or centered on academics, a third on a social network server 102c (not separately shown) directed to local business, a fourth on a social network server 102d (not separately shown) directed to dating, and yet others on social network server (102n) directed to other general interests or perhaps a specific focus.
A profile server 130 is illustrated as a stand-alone server in
The social network server 102a includes a content-visibility-determination/control application 106a, to which user devices 115a through 115n are coupled via the network 105. In particular, user devices 115a through 115n may be coupled, via signal lines 114a through 114n, to the network 105. The user 125a interacts via the user device 115a to access the content-visibility-determination/control application 106 to either create, share, and/or view social content within a social network. The content-visibility-determination/control application 106 or certain components of it may be stored in a distributed architecture in one or more of the social network server 102, the third party server 134, and the user device 115. In some implementations, the content-visibility-determination/control application 106 may be included, either partially or entirely, in one or more of the social network server 102, the third party server 134, and the user device 115.
The user devices 115a through 115n may be a computing device, for example, a laptop computer, a desktop computer, a tablet computer, a mobile telephone, a personal digital assistant (PDA), a mobile email device, a portable game player, a portable music player, a television with one or more processors embedded in the television or coupled to it, or an electronic device capable of accessing a network.
The network 105 may be of conventional type, wired or wireless, and may have a number of configurations for example a star configuration, token ring configuration, or other configurations. Furthermore, the network 105 may comprise a local area network (LAN), a wide area network (WAN, e.g., the Internet), and/or another interconnected data path across which one or more devices may communicate.
In some implementations, the network 105 may be a peer-to-peer network. The network 105 may also be coupled to or include portions of one or more telecommunications networks for sending data in a variety of different communication protocols.
In some instances, the network 105 includes Bluetooth communication networks or a cellular communications network for sending and receiving data for example via short messaging service (SMS), multimedia messaging service (MMS), hypertext transfer protocol (HTTP), direct data connection, WAP, email, etc.
In some implementations, the social network servers, 102a-102n, the profile server 130, the web server 132, and the third party servers 134a through 134n are hardware servers including a processor, memory, and network communication capabilities. One or more of the users 125a through 125n access one or more of the social network servers 102a through 102n, via browsers in their user devices and via the web server 132.
As one example, in some implementations of the system, information of particular users (125a through 125n) of a social network 102a through 102n may be retrieved from the social graph 108. It should be noted that information that may be retrieved for particular users is only upon obtaining the necessary permissions from the users, in order to protect user privacy and sensitive information of the users.
A user 125a, via a user device 115a, may either create, share, and/or view social content within a social network, via communication unit 241. In some implementations, the user device may be communicatively coupled to a display 243 to display information to the user. The content-visibility-determination/control application 106a and 106c may reside, in their entirety or parts of them, in the user's device (115a through 115n), in the social network server 102a (through 102n), or, in a separate server, for example, in the third party server 134 (
Referring now to
The content-visibility-determination/control application 106 includes applications or engines that communicate over the software communication mechanism 320. Software communication mechanism 320 may be an object bus (for example CORBA), direct socket communication (for example TCP/IP sockets) among software modules, remote procedure calls, UDP broadcasts and receipts, HTTP connections, function or procedure calls, etc. Further, the communication could be secure (SSH, HTTPS, etc.). The software communication may be implemented on underlying hardware, for example a network, the Internet, a bus 220 (
The user-interface module 301 may be software including routines for generating a user interface. In some implementations, the user-interface module 301 can be a set of instructions executable by the processor 235 to provide the functionality described below for generating a user interface for displaying content within a social network. In other implementations, the user-interface module 301 can be stored in the memory 237 of the social network server 102 and/or the third party server 134 and can be accessible and executable by the processor 235. In either implementation, the user-interface module 301 can be adapted for cooperation and communication with the processor 235, the communication unit 241, data storage 239 and other components of the social network server 102 and/or the third party server 134 via the bus 220.
In some implementations, the user interface module 301 receives social content from one or more users of the social network. For example, the user interface module 301 receives one or more posts, comments, invitations, user profiles, etc., from one or more users of the social network.
In some implementations, the user interface module 301 generates a user interface for displaying information received from one or more modules described below. For example, the user interface module 301 generates one or more user interfaces for displaying user profile information, user content, and/or other information relating to the social network.
The user-tag-determination module 303 may be software including routines for determining users tagged in social content. In some implementations, the user-tag-determination module 303 can be a set of instructions executable by the processor 235 to provide the functionality described below for determining one or more users tagged/included in the social content. In other implementations, the user-tag-determination module 303 can be stored in the memory 237 of the social network server 102 and/or the third party server 134 and can be accessible and executable by the processor 235. In either implementation, the user-tag-determination module 303 can be adapted for cooperation and communication with the processor 235, the communication unit 241, data storage 239 and other components of the social network server 102 and/or the third party server 134 via the bus 220.
In some implementations, the user-tag-determination module 303 determines one or more users in social content (e.g., pictures, posts, videos, social lists, etc.). For example, the user-tag-determination module 303 determines one or more users and their corresponding profile in a photograph and/or video (e.g., by tags, face recognition, etc.). In some instances, the user-tag-determination module 303 identifies users in a post, friends list, invitation of an event, etc.
The social-affinity-determination module 305 may be software including routines for determining social affinities. In some implementations, the social-affinity-determination module 305 can be a set of instructions executable by the processor 235 to provide the functionality described below for determining the social affinity among the one or more users tagged/included in the social content and the user that posted the content. In other implementations, the social-affinity-determination module 305 can be stored in the memory 237 of the social network server 102 and/or the third party server 134 and can be accessible and executable by the processor 235. In either implementation, the social-affinity-determination module 305 can be adapted for cooperation and communication with the processor 235, the communication unit 241, data storage 239 and other components of the social network server 102 and/or the third party server 134 via the bus 220.
In some implementations, the social-affinity-determination module 305 determines the social affinity between one or more users of the social network. For example, the social-affinity-determination module 305 determines that some of the users obtained from the user-tag-determination module 303 (e.g., users in a tagged photograph) are friends with each other and others are not friends with each other.
The user-settings-determination module 307 may be software including routines for determining user settings. In some implementations, the user-settings-determination module 307 can be a set of instructions executable by the processor 235 to provide the functionality described below for determining the user privacy setting designations within the user's social profile. In other implementations, the user-settings-determination module 307 can be stored in the memory 237 of the social network server 102 and/or the third party server 134 and can be accessible and executable by the processor 235. In either implementation, the user-settings-determination module 307 can be adapted for cooperation and communication with the processor 235, the communication unit 241, data storage 239 and other components of the social network server 102 and/or the third party server 134 via the bus 220.
In some implementations, the user-settings-determination module 307 receives input (direct or indirect) from a user profile and sets the user settings for privacy (e.g., visibility of content that references the user). For example, a user indicates that he/she wants content (in which he or she is either referenced, involved, or included) to be private and the user-settings-determination module 307 sets the user's reverse privacy preference to “private.” In some instances the privacy may be indicated in a variable scale indicating different levels of privacy. This setting specifies how to protect a user's identity when the user's identity appears in other user's posts. For example, if a user is tagged in a photograph and the tagged user has designated a “reverse” privacy setting as “only my friends can see it,” then, only friends who are determined to be common with the user who posted the content may view it. In this instance, the common friends are those friends of the user that posted the content and the tagged user, in other words, friends who appear in both their friend lists, may view the tagged user's image or name in the content.
The visibility-execution module 309 may be software including routines for setting the visibility of social content. In some implementations, the visibility-execution module 309 can be a set of instructions executable by the processor 235 to provide the functionality described below for setting the visibility of the content based on the privacy settings of the one or more users tagged/included in the social content and the user that posted the content. In other implementations, the visibility-execution module 309 can be stored in the memory 237 of the social network server 102 and/or the third party server 134 and can be accessible and executable by the processor 235. In either implementation, the visibility-execution module 309 can be adapted for cooperation and communication with the processor 235, the communication unit 241, data storage 239 and other components of the social network server 102 and/or the third party server 134 via the bus 220.
In some implementations, the visibility-execution module 309 sets the visibility of the social content based on the social affinity information (from the social-affinity-determination module 305) and/or the user's preference (from the user-settings-determination module 307). For example, the visibility-execution module 309 determines that a tagged user's preference is set to private and sets the visibility to “not visible” if the user attempting to view the content does not share a social affinity with the tagged user (e.g., not friends).
In the preceding description, for purposes of explanation, numerous specific details are indicated in order to provide a thorough understanding of the technology described. This technology may be practiced without these specific details. In the instances illustrated, structures and devices are shown in block diagram form in order to avoid obscuring the technology. For example, the present technology is described with some implementations illustrated above with reference to user interfaces and particular hardware. However, the present technology applies to a computing device that can receive data and commands, and devices providing services. Moreover, the present technology is described above primarily in the context of determining and controlling social content visibility within a social network; however, the present technology may apply to a situation and may be used for other applications beyond networks, in particular, social networks. In particular, this technology may be used in other contexts besides social networks.
Reference in the specification to “one implementation,” “an implementation,” or “some implementations” means simply that one or more particular features, structures, or characteristics described in connection with the one or more implementations is included in at least one or more implementations that are described. The appearances of the phrase “in one implementation or instance” in various places in the specification are not necessarily referring to the same implementation or instance.
Some portions of the detailed descriptions that precede are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory of either one or more computing devices. These algorithmic descriptions and representations are the means used to most effectively convey the substance of the technology. An algorithm as indicated here, and generally, may be conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be understood, however, that these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, as apparent from the preceding discussion, it should be appreciated that throughout the description, discussions utilizing terms, for example, “processing,” “computing,” “calculating,” “determining,” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission, or display devices.
The present technology also relates to an apparatus for performing the operations described here. This apparatus may be specially constructed for the required purposes, or it may include a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. For example, a computer program may be stored in a computer-readable storage medium, for example, but not limited to, a disk including floppy disks, optical disks, CD-ROMs, magnetic disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, flash memories including USB keys with non-volatile memory or a type of media suitable for storing electronic instructions, each coupled to a computer system bus.
This technology may take the form of an entirely hardware implementation, an entirely software implementation, or an implementation including both hardware and software components. In some instances, this technology may be implemented in software, which includes but may be not limited to firmware, resident software, microcode, etc.
Furthermore, this technology may take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or an instruction execution system. For the purposes of this description, a computer-usable or computer-readable medium may be an apparatus that can include, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
A data processing system suitable for storing and/or executing program code includes at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements may include local memory employed during actual execution of the program code, bulk storage, and cache memories, which provide temporary storage of at least some program code in order to reduce the number of times code may be retrieved from bulk storage during execution.
Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) may be coupled to the system either directly or through intervening I/O controllers.
Communication units including network adapters may also be coupled to the systems to enable them to couple to other data processing systems, remote printers, or storage devices, through either intervening private or public networks. Modems, cable modems, and Ethernet cards are just a few examples of the currently available types of network adapters.
Finally, the algorithms and displays presented in this application are not inherently related to a particular computer or other apparatus. Various general-purpose systems may be used with programs in accordance with the teachings here, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems is outlined in the description above. In addition, the present technology is not described with reference to a particular programming language. It should be understood that a variety of programming languages may be used to implement the technology as described here.
The foregoing description of the implementations of the present technology has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the present technology to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the present technology be limited not by this detailed description, but rather by the claims of this application. The present technology may be implemented in other specific forms, without departing from the spirit or essential characteristics thereof. Likewise, the particular naming and division of the modules, routines, features, attributes, methodologies, and other aspects are not mandatory or significant, and the mechanisms that implement the present disclosure or its features may have different names, divisions and/or formats. Furthermore, the modules, routines, features, attributes, methodologies and other aspects of the present technology can be implemented as software, hardware, firmware, or a combination of the three. Also, wherever a component, an example of which may be a module, of the present technology may be implemented as software, the component can be implemented as a standalone program, as part of a larger program, as a plurality of separate programs, as a statically or dynamically linked library, as a kernel loadable module, as a device driver, and/or in other ways. Additionally, the present technology is in no way limited to implementation in a specific programming language, or for a specific operating system or environment. Accordingly, the disclosure of the present technology is intended to be illustrative, but not limiting, of the scope of the present disclosure, which is set forth in the following claims.
