SYSTEM AND METHOD FOR CREATING A SECURE TRUSTED SOCIAL NETWORK
A system for a plurality of users to share resources with access, control and configuration based on pre-defined relationships of trust between the users of the system. A computer-based authority provides the services of authentication, identification and verification of each user within network. Processes are described that leads to the formation of an electronic community, which facilitates electronic communication and transactions in a defined manner.
The history of computing and computer network architecture can be viewed as a spectrum falling between a more centralized approach in a Client-Server environment and the decentralized approach of a Peer-to-Peer environment. Each architecture has been used to build electronic communities and create various forms of computer services.
A simple example of a Client-Server environment is a website. A website is a service provided by a web server. Third party computing devices access the website by connecting to the web server through a network connection (via the Internet, through a Local Area Network or the like). One problem associated with Client-Server environments is that the server and the bandwidth required to service the number of request must also be able to scale with the growth of the number of third party devices seeking to access the server.
Alternatively, Peer-to-Peer environments are networks in which each computing device connected to the network can have equivalent capabilities and responsibilities. Peer-to-Peer environments are generally simpler to create and maintain than Client-Server environments and, at present, do not offer the same performance under heavy loads. Examples of Peer-to-Peer networks are file sharing networks such as Napster (http://www.napster.com), E-donkey (http://www.edonkey2000.com) or Kazaa (http://www.kazaa.com). Each of these examples allow for direct connections between individual computing devices in the network to exchange files. The problems associated with Peer-to-Peer networks involve, among others a lack of security, control and authenticity of the requested files. There are no limits on access to these networks and therefore users have no way to ascertain the quality or source of the received file. This lack of security hampers the utility of Peer-to-Peer environments because users are unwilling to allow strangers access to their systems.
Mixed Client-Server and Peer-to-Peer system can be developed. For example, U.S. Pat. No. 6,366,907 to Fanning et al. discloses a centralized database to locate resources within a peer-to-peer network. However, Fanning et al. do not address the problems of security or control.
There is therefore a need for an environment that provides for a network that provides a solution to the problems of scalability of Client-Server environments as well as a solution to the security or control problems associated with Peer-to-Peer environments. The present invention addresses such a need as it uses a Client-Server environment to identify, authenticate and control access to a Peer-to-Peer network. In addition, this invention applies the ideas of pre-existing social relationships characterized by trust to the access control of the Peer-to-Peer network to create a flexible and secure network.
The importance of social relationships and social networks were publicly recognized by Milgram in “The Small World Problem”, Psychology Today, May 1967. pp 60-67. His theory, known as the “Six degrees of separation” or “The Small World Problem”, suggests that anyone on the planet can be connected to any other person on the planet through a chain of acquaintances that has no more than five intermediaries. Based on this idea, in U.S. Pat. No. 6,175,831, Weinreich, et al. describe a process to build a database of linkages, and, in U.S. Pat. No. 6,360,222, Quinn describes a process to modify directory structures. However, neither Weinreich nor Quinn address the creation of a flexible network based on the concept of social relationships in a Peer-to-Peer computing environment and do not address the issue of identification and authentication when accessing network services.
U.S. Pat. No. 5,941,947 to Brown et al. describes a system and method for controlling access to data entities in a computer network using the concept of control access rights list (ACL) to assign network privileges to users and groups of users. The disadvantage of this design is that it does not allow users to communicate with one another in a Peer-to-Peer environment.
U.S. patent application Ser. No. 10/165,330 assigned to Yeager et al. and U.S. patent application Ser. No. 10/285,133 assigned to Yeager and Chen, describe the creation and distribution of a trust mechanism within a Peer-to-Peer network. In their implementation, trust is a value that is quantitatively calculated through the interaction of peers or determined a priori as a numerical value by the user. The total trust and risk of an object on their network can then be established as a path summation of the nodes that offers the object. The disadvantage of this design is that it requires a series of interactions between users on the network before a level of trust can truly be established. There is no provision for ratings based on pre-existing relationships of trust. In addition, the work of Yeager et al., does not provide a mechanism to identify and authenticate a user and relied on their defined “Trust mechanism”.
The key element in the establishment of a social network is the implicit understanding of the concept of “trust” between known users of a social network. Trust is defined in Merriam-Webster's Dictionary as “assured reliance on the character, ability, strength, or truth of someone or something”. The nature of trust has proved to be elusive and has been discussed extensively in the context of philosophy. The practical implications of trust can be explained using game theory, human physiology and psychology. The concept of trust also forms the basis of corporate strategy, and economics and sociology.
In the Republic (Plato, 390 BC), Plato suggests that trust exists because of the rules governing social transactions and the fear of punishment for disobedience. In this world view, self interest is the major component of trust (see for example, Niccolo Machiavelli (1513), The Prince and Thomas Hobbes (1651), Leviathan, or the Matter, Forme, and Power of a Commonwealth, Ecclesiasticall and Civil). In contrast, other worldviews introduce the properties of innate goodness of man, sympathy (for example, David Hume (1739), A Treatise of Human Nature) or shared morality (Immanuel Kant (1790), The Science of Right) as the basis for trust.
Strategic interactions among humans can be described using mathematics. This was first demonstrated by Von Neumann in Theory of Games and Economic Behavior (1944) in the field of game theory. In game theory, it can be shown that there are optimum strategies for dealing with given situations or confrontations and the strategy depends on the goals of rational participants. For example, there are different strategies depending on whether one's objective is to maximize the probability of achieving a goal, maximizing one's gains, minimizing one's losses or risk, or ensuring that one's opponent suffers the greatest damage. A classical example of game theory is known as the “Prisoners' Dilemma” (A. W. Tucker (1950), memo republished in On Jargon: The Prisoner's Dilemma, UMAP Journal 1, 101, 1980) which established the value of trust among participants. In this hypothetical situation, the best possible outcome for the group as a whole occurs if each user trusts each other. In contrast, the worst possible results for the group occur when each user acts in their own interest.
Social organizations both formal and informal are a trait shared by all human beings. Interaction between relatives, family and kin can be explained based on a biological imperative. By including the element of trust to the psychological development of man, explanation of human interactions can be extended to friends and other members of social groups, businesses, communities, cultures and even nations. Elements involved in trust in a sociological context includes an expectation of future cooperation and a sense of reciprocity.
Trust is also recognized as a valuable component of business strategy (see for example, Robert Bruce Shaw and Jossey-Bass (1997), Trust in the Balance: Building Successful Organizations on Results, Integrity, and Concern, Jossey-Bass Business & Management Series). Trust exists within the human behaviour spectrum of confidence (result of specific knowledge built on reason and facts) and faith (belief that is largely immune to contradictory information or events). Trust for an individual can be characterized as a belief that those on whom the individual depends will fulfill that individual's expectations of them. In a sense, therefore, predictability of behaviour engenders trust. For individuals, varying levels of trust can be established based on fulfilling expectations, acting with integrity and being empathetic.
The concept of trust is also a key element in the theories of macro-economics. In this context, trust can be characterized as an expectation within a community that users of the community will exhibit regular, honest, and cooperative behaviour, based on commonly shared norms. The existence of trust creates social capital, which in turn determines the size of firms, businesses and even economies.
The ability to collaborate on and to edit documents, share views and activities is an important function of a network. Previously, such activities were carried out in two ways: either via a Web-based content management system (CMS) or through a Peer-to-Peer collaborative environment. In a Web-based system, the resources are located in one central location with specific functions provided by a web server and a database (see for example, CMS Review 2005 at http://www.cmsreview.com). In decentralized systems, individual machines execute local programs to create a shared environment connected by a network (see for example, U.S. Pat. Nos. 6,859,821; 6,640,241; and 6,446,113 to Ozzie et al.). However, in a web-based system, a central computer is required which can be complicated to setup and maintain. In a pure Peer-to-Peer system, the management of access control can be quite burdensome. There is therefore a need for a network which can be easily established, added to and maintained but where authentication of users is managed. In the present invention, where the users are all connected by pre-existing relationships characterized by trust, access issues are easily dealt with and each trusted peer computer can collaborate and edit information using local resources.
Traditionally, borrowing and lending activities are carried out through financial institutions such as banks or informally. In 2005, Zopa™ launched the first peer-to-peer lending network in the United Kingdom (http://www.zopa.com/). Zopa™ syndicates loans requested by “borrower” members out to “lender” members, based on criteria and parameters set by both parties. One main important criterion for lending is the credit-worthiness of the borrower (for more information see http://news.bbc.co.uk/1/hi/business/4325761.stm). Zopa™ allows strangers to lend money to strangers. Access to the system is contingent upon the users passing a credit check.
SUMMARY OF THE INVENTIONAn object of the present invention is to provide a system for a plurality of users to share resources. In accordance with an embodiment of the present invention, there is provided system for a plurality of users to share resources comprising: one or more software clients, each of said software clients installed on a computing device; one or more trusted servers; one or more communication means allowing communication between said one or more trusted servers and said one or more software clients, wherein said trusted servers comprise: a network interface operable to receive data packets from the software clients and further operable to send processed data packets to the software clients; a processing engine in communication with the network interface, said engine operable to associate each data packet with an identifier and to thereby provide said processed data packets; a database containing an identifier associated with each software client in said system, and wherein each identifier in said database is related to each other identifier by means of a criterion, wherein said criterion is the degree of separation between one user of a software client and a second user of a software client based on a pre-existing relationship of trust, as defined by said users.
In accordance with an alternative embodiment of the present invention, there is provided a system for a plurality of users to share resources, said system produced by the following process:
-
- a) providing a software client to a first user for installation on a first computing device;
- b) receiving a first set of data packets relating to said first user from said software client to one or more trusted servers via one or more communication means;
- c) compiling a database of said first data packets;
- d) receiving a second set of data packets relating to at least one second user with whom said first user has a pre-existing relationship defined by a criterion, wherein said criterion is trust, as defined by said first and second user;
- e) adding said second set of data packets to the database and relating said second set of data packets to said first set of identifying data by means of said criterion;
- f) providing the software client to the second user for installation on a second computing device;
wherein, said first, second, or new user can repeat steps b to f resulting in additional users being added to said system.
In accordance with an alternative embodiment of the present invention, there is provided a method of searching for information, resources or services contained on a computing device connected to the system of claim 1, based on the properties of the object as well as criteria as specified by the user wherein the search can be conducted either by said software client or be the trusted server.
In accordance with alternative embodiment of the present invention, there is provided a method for creating a market on a system for a plurality of users to share resources, said method comprising the following steps: establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another user based on a pre-existing relationship of trust, as defined by said users; and providing a market server connected to said network wherein said computing devices can exchange processed data packets with said market server; wherein said processed data packets relate to the buying and selling of goods and wherein said market server coordinates interactions between said users of said computing devices.
In accordance with an alternative embodiment of the present invention, there is provided a method for creating an auction on a system for a plurality of users to share resources, said method comprising the following steps: establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and providing an auction server connected to said network wherein said computing devices can exchange processed data packets with said auction server; wherein said processed data packets contain information relating to the designation of objects that are available to be auctioned, and bids for said by one or more of said users; and wherein said auction server manages said processed data packets to manage and regulate auctions on said network according to pre-set rules.
In accordance with an alternative embodiment of the present invention, there is provided a method for playing games via a system for a plurality of users to share resources, said method comprising the following steps: establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and providing a game server connected to said network wherein said computing devices can exchange processed data packets with said game server; wherein said processed data packets contain information relating to a game in which the users are participants; and wherein said game server coordinates and manages the interactions between the users according to pre-set rules.
In accordance with an alternative embodiment of the present invention, there is provided a method for distributing one or more objects to members of a system for a plurality of users to share resources, said method comprising the following steps: establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; providing one or more trusted servers connected to said network wherein said computing devices can exchange processed data packets with said one or more trusted servers; establishing a list of unique network identifiers corresponding to users who wish to receive the object and the location of a folder on said computing devices of said users designated to receive said one or more objects, said list located on said trusted servers; transmitting said one or more objects to said one or more trusted servers with instructions to distribute said object to the members on said list; and transmitting said one or more objects from said one or more trusted servers to the members of said list.
In accordance with an alternative embodiment of the present invention, there is provided a method for banking via a system for a plurality of users to share resources, said method comprising the following steps: establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and providing a banking server connected to said network wherein said computing devices can exchange processed data packets with said banking server; wherein said processed data packets contain information relating to communication between said two or more users relating to borrowing or loaning money from one of said two or more users to another of said two or more users; and wherein said banking server coordinates and manages the interactions between said users according to pre-set rules.
BRIEF DESCRIPTION OF THE FIGURESFurther features of the invention, its nature and various advantages will be more apparent from the accompanying drawings, and the following detailed description in which like reference numerals refer to like elements and in which:
The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
The present invention submits that acceptable social behaviour or trust can be codified as a security rule and through its implementation can create a secure electronic community. For example, the simple rule “I trust my close peers and will therefore allow them access to my computing device” can be extended to include “I trust peers of my peers and will therefore allow them access to my computing device”. This logic can be extended recursively until the list of immediate and extended social links are exhausted. The underlying social expectations inherent in a pre-existing relationship characterised by trust, forms the security rule for a Peer-to-Peer network. The trust that forms the basis of social relationships can also be found in the workplace. In such cases, the implicit trust is based on the roles of an individual within an organization. For example, the CEO of a company allows the vice presidents permission to access a company resource. The vice presidents can allow their managers access to the same resource without the intervention of the CEO or another central administrator. The implications for this type of environment are that each user, through their role within an organization, is responsible and can make resource access decisions. This role-based trust can once again form the basis of the security rule for establishing a Peer-to-Peer network. The criteria of trust therefore is defined independent of the actions occurring within the network, does not need to be quantitatively assigned, and is derived from pre-existing social networks.
The system is a combination of a Peer-to-Peer network and Client-Server network formed of computing devices designed to permit users to share resources. Users are understood to be human beings. Resources can include without being limited to: data, digital files, memory, processing power, and storage space. A computing device would be understood by a worker skilled in the art to include any electronic device with storage and computing capability and a communication means with which to communicate with other computing devices. Computing devices may include but are not limited to computers, cell phones, mp3 players, pagers, gaming consoles, handheld gaming devices, wireless devices, and personal digital assistants. The communications means would be understood by a worker skilled in the art to include any necessary elements of hardware, including but not limited to communications ports, wireless transmitter/receivers, wires or fibre optics, and software, including but not limited to telephony, e-mail, facsimile, Bluetooth®, TCP/IP, FTP, XML, and IRC, that allow a computing device to exchange data packets with another computing device.
Access, control and configuration of the system are based on user-defined social relationships. Trusted servers provide the services of authentication, identification and verification for each user within the network. The trusted servers are computing devices connected to the network that can identify, verify and authenticate users of the network. This process defines who the users are, for example by means of a login and password, and where they are located in relation to other users of the network, for example an IP address. The trusted server can confirm these facts as part of an authentication process. Authorization and some services are provided by the trusted servers in a client-server environment. Once users are authorized to access the system, interactions between users take place in a Peer-to-Peer environment.
A software client installed on each computing device connected to the network acts as an interface to allow the user to communicate with the trusted servers and other computing devices. Initial access to the network is controlled by each of the users who can invite members of their trusted social network to access the network. Once invited, a new user can download the software client, access the network and invite new members. Processes are described that lead to the formation of electronic communities, which facilitates communication between computing devices connected to the system and transactions between those computing devices in a defined manner.
As each user is added to the network they are assigned a criterion N, defined as the degree of separation relative to the other users on the network. For example, User A invites a trusted friend, User Z to join the system. User A and User Z have a degree of separation of 0, thus N=0. If User Z invites another trusted friend, User Z1 to join the network then User Z and User Z1 will have a degree of separation of 0 and User Z1 and User A will have a degree of separation of 1. Users of the system can define the required degree of separation necessary to access resources on their computing device. If User A wishes to restrict access only to his or her friends, he or she sets access rules to N equals 0. The effect of different definitions of N is explored in the following table:
Table 1. An example of network access based on degrees of separation.
Once user are connected based on their defined properties, they can communicate and share services and resources. Some examples of interactions and services that are possible using this type of system are: transfer and exchange of electronic files, transfer or exchange of text messages and/or transfer and exchange of voice data, such as executable programs, digitized music, video and photo files, streamed media such as videos, remote access and file sharing, transaction based electronic markets, electronic markets of electronic and non-electronic goods and resources, auctions and reverse auctions, instant messaging (IM) services. Voices Over Internet Protocol (VOIP) services, interactive video services, electronic resource sharing such as hard drive space and processor capacity, non-electronic resource sharing, information collaboration and management, playing games, advertising, multi-level marketing programs, information distribution, distribution of digital content involving digital rights management, collaboration on projects involving editing and distribution of information, distribution and synchronization services for information, banking services, directed distribution incorporating push technology, and RSS feed services.
Due to the relationships of trust present between users of the system, the present invention allows users to share resources without the need to negotiate access on a case-by-case basis.
Alternatively, in a business or professional environment, pre-existing social relationships are replaced by roles that are pre-defined by the position and responsibility of the individual within an organization. The same trust and security issues exist and can be used to form networks using the present invention.
Although the embodiments discuss a single network of users linked through pre-existing social relationships it should be understood that the present invention may consist of an unlimited number of such social networks existing parallel to one another. If none of the members of two networks have a pre-existing social relationship to one another, members of one network will be unaware of the existence of members of the other network or networks for the purposes of interaction via the system.
The process diagrams shown in the figures provide a high level view of the specific processes. The system is comprised of various steps outlined below, with the numbers in brackets representing the corresponding steps in the detail process description and the corresponding flowchart:
Setup (0000-0100)
Propagation (0100-0499)
New User Contacted Through trusted server (0100-0499)
Direct User-to-User Contact (0300-0402)
Linking known clients (0400-0499)
Logon-Logoff from Client (0500-0799)
Logoff gracefully (0600-0699)
Logoff suddenly (0700-0799)
Searching (4000-4999)
Searching through trusted Client (4000-4099)
Searching through Location Server (4100-4250)
Transfer/Exchange/Communications (5000-5999)
Remote access (6000-6099)
Setup (0000-0100)
Referring to
Propagation (0100-0499)
Propagation describes the process of how a user, in this case, User A adds another user whom they trust as a result of a pre-existing relationship (e.g. friends, family, and co-workers). This process can be repeated indefinitely to build up a list of trusted peers for User A.
User A can add a trusted peer in three ways:
ask trusted servers to contact a new user;
direct new user to the trusted servers, or
linking two users already on the network.
Each of these scenarios will be described in more detail as follows.
New User Contacted Through Trusted Servers (0200-0299)
With reference to
Direct User to User Contact (0300-0399)
In an alternative embodiment of the present invention, the new user is contacted by another user directly and prompted to sign up for the service. With reference to
Linking Users Already on the Network (0400-0499)
In an alternative embodiment of the present invention, a user wishes to establish a linkage with another user that is already a member of the network. With reference to
Logon to the Network with the Client Software (0500-0599)
The process of access to the trusted network by a user using the client software is summarized in
Logoff (0600-0799)
In one embodiment of the present invention, there are two ways to logoff or disconnect from the network. The two ways are:
Logoff gracefully—when the user can exit the program using a series of predefined steps.
Logoff suddenly—when the connection was terminated abruptly.
Each of those steps is described in this section.
Logoff Gracefully 0600-0699
The process details regarding disconnecting or logging off from the network gracefully are summarized in
Logoff Suddenly 0700-0799
The process details for when a software client suddenly disconnects from the network is summarized in steps 0700-0799. A process diagram for those steps is given in
Searching 4000-4999
In one embodiment of the present invention, there are provided three ways of searching or discovering resources through the network. The processes are defined as:
Query through trusted clients including identification information
Query using relays
Query through the trusted servers
These three processes are not mutually exclusive and can be used in conjunction with each other to search the network.
Searching Through Trusted Clients Including Identification Information 4000-4099
In this type of search, the search is carried out on the trusted social network with the user identification being transmitted along with the query. This type of searching provides the least amount of privacy and anonymity to the searcher. The process details for searching through trusted clients are summarized in steps 4000-4099. The process diagram is given in
With reference to
Query Using Relays 4100-4250
In certain cases, the initiator of a query wishes to protect their anonymity or limit the knowledge of their identity only to their own trusted peers. In such a case, identification information of the initiator is not passed on with the search query through the trusted network. Each user queried is only aware of the identity of the user who forwarded the query to them, not the identity of the initiator. The process details for searching in this fashion are summarized in steps 4100-4250. The process diagram is given in
In this method, only the trusted peers of the initiator know the identity of the initiator. The computing device for each User receives only the information on the last user to forward the query or to respond. With reference to
Searching Through Location Server 4300-4399
Search processes can also be carried out through the use of a search service that can be a part of the trusted servers. The search service in this case will be used to generate the list of users that need to be contacted, contact each user with the query, summarize the response and send this response back to the originator of the query. The process details for searching through the location server are summarized in steps 4300-4399. The process diagram is given in
Services and Applications Over the Trusted Network 5000-5599
In one embodiment of the present invention here are provided three ways in which actions and applications can be carried out over the trusted network. The three ways are
Direct connection
Connection through a trusted proxy
Delivery though relays
Example of actions and applications are, for example,
Electronic resource sharing
Communication
Data exchange
Service sharing
The implementation details will be described in the following sections. More specific examples of actions and applications are described in the embodiments of the present invention described herein.
Direct Connections (5000-5200)
Direct connections can be established through the Login process (0500-0599). Through the Searching process (4000-4999) a user can be connected directly to another trusted peer on the network. In this case, any actions and applications can be carried out directly between the two users in a Peer-to-Peer environment. In this case the trusted servers supply location information to allow the software clients of two trusted peers to connect but are otherwise not involved.
Connection Through a Trusted Proxy (5200-5399)
In some cases, direct connections cannot be established between trusted peers on the network due to the presence of a firewall or other protective measures available on a network. In this case, the user must first request a connection to a trusted proxy server before connecting to the other user. A proxy is a service that allows clients to make indirect network connections to other users. A User connects to the proxy server, and then requests a connection, file, or other resource available on another trusted peer. The proxy provides the resource, possibly by connecting to the specified user, or by serving it from a cache.
Delivery Through Relay (5400-5599)
In some cases, a user wants to their identity to be known only to those users that the User trusts (i.e. users that are directly related to them i.e. N=0) but still wishes to exchange information with users with a greater degree of separation. Services and actions can still be delivered through a series of relays if the initial search and discovery for the services and action is performed using the search with some degree of privacy option (4100-4250). In which case, the application or service can be delivered based on the path developed by the search. The process diagram is given in
Remote Access and Control of the Software Client (6000-6099)
The services of the software client on a computing device can be accessed remotely if the proper communication, authentication and identification processes are built into the software client. The process diagram for remote access is given in
Collaboration Between Trusted Peers
In an alternative embodiment of the present invention, there is provided a peer-to-peer social network with collaboration features.
Information is one particular type of resource that is ideally suited to be accessible and available on a trusted social network. Examples of information include but not limited to digital movies, digital music or different types of documents (e.g. text files, spreadsheets, graphic files, etc.).
Similar to the process above, a trusted peer, who is connected to the network and who is a trusted peer of User A can query the editing server for new collaborating objects or edit the objects using local resources.
The editing server responds to queries based on the rules and regulations governing access to information and regulates the transfer of collaboration objects between trusted peers. The steps for information delivery are as follows:
-
- a) The editing server notifies each trusted peer that an update to a collaborating file is available.
- b) Each trusted peer has the choice of accepting or declining the update. This setting can be set to a default value so that a trusted peer will always obtain the latest versions.
- c) Each trusted peer accepting the update receives the new object by downloading the latest version.
- d) Trusted peers that have the latest update can become a source of the new object until the object is distributed to all trusted peers within the preset degrees of separation.
The editing server is connected to each member of the trusted social network to ensure that each member has the appropriate access to the information. Depending on the type of version control system required, the type of resource information control stored in the editing server is as follows:
-
- a) Check in/check out—whether a file is being edited by another trusted peer.
- b) Permissions—who can have rights to view and modify the file and to what degree of social relationship should the collaborative object be extended.
- c) Most recent version—parameters that identify whether the file is the most recent version of the file.
- d) Differences—rather then checking in the entire file, compare the differences between files and update the differences.
As a result of this system, information can be edited, manipulated, grouped and shared on a trusted network according to the preference of each individual user.
In an alternative embodiment of the present invention, users can share and synchronize objects such as files, folders, or local resources in a trusted network. Synchronization is a feature that allows multiple users of a trusted network to have objects such as files, folders, links or local resources with the same content. The system works by allowing a user to declare that an object should be managed by a synchronization server and that the object is to be shared amongst a designated list of trusted peers on the network. The synchronization server ensures that all valid users can access a copy of the object and also can receive updates if the object is changed.
The process of implementing a synchronization feature in a trusted Peer-to-Peer network is similar to that of collaboration as discussed above. The main difference is the introduction of a synchronization server that controls the flow of information and enforces rules, which are unique to the synchronization process.
As described above, any user who belongs to the initiator's social network and who falls within the degree of separation defined by the initiator can search and subscribe to the synchronization object at any time. The synchronization object behaves just like any other shared resources in the social network except that some of its properties are controlled by the synchronization server.
Each synchronization object is updated depending on the initial parameters. For example,
-
- Everyone can contribute changes—in this case, the synchronization server ensures that all the synchronization objects within the network are identical.
- Only some can contribute changes—in this case, the synchronization server ensures that synchronization objects belonging to users, defined as contributors, are identical. This group's objects are then distributed through the network.
- Only the initiator can contribute changes—in this case, the synchronization server ensures that every synchronization object is an exact copy of the initiator's object.
As a result, users on a social network use this service to create duplicate objects throughout the network and synchronize any changes to those objects. The uniqueness of this type of synchronization service is that it automates a common activity in a network.
Banking Services
In an alternative embodiment of the present invention, a system is provided to allow users of a social network to easily lend money to one another.
Within a trusted P2P network, the risks inherent in borrowing and lending activities can be lessened because each user of the network is a trusted peer of other users. The trusted server can act as the facilitator of financial services between trusted peers and their social networks. Rather then banking with strangers, and mitigating risk through credit checks or secured loans, users of the social network can pool their resources to assist each other financially. The advantage of this approach is the increase the likelihood of having a loan repaid because a user is dealing with member of their social network. This system also reduces the dependence on external factors such as “credit worthiness” of an individual.
The process for P2P banking in a trusted P2P network is similar to that of collaboration as discussed above. The main difference is the introduction of a banking server that controls the flow of information and enforces rules for users participating in the market. Users first choose the role that he or she is willing to play in the banking service, namely either borrower or lender. The lender sends to the banking server information about the user's lending preferences. Examples of such preferences are the amount of money they are willing to lend, the desired interest rate, the loan period and the degree of separation to the borrower to whom they are willing to lend money. The borrower sends to the banking server 400 information about their borrowing preferences. Examples of such preferences are the amount of money that the user wishes to borrow, the desired interest rate, and the degree of separation to the lender to whom the user is willing to borrow money.
The banking server 400 ensures that the borrower makes the proper loan payments and that each payment is credited to the proper lender's account. Other duties of the banking server include:
-
- Late payments and loan delinquency—establish policies to deal with late payments and loan delinquency.
- Reputations—create a history of transactions for both lender and borrower.
- Enforcement—upholding the integrity of the service.
As a result, users on a social network can freely trade and profit from their resources. The advantage of this type of collaboration over existing systems is that it duplicates the social relationships that already exist between each member of the trusted network and enables them to create a new type of financial service.
Push Communication
A further embodiment of the present invention allows content to be distributed to users of a social peer to peer network using push methods. Push is a feature that allows a user to send a file to a recipient rather than requiring a user to discover and request a file. In an open network where there is no defined relationship between users, push features can lead to abuses such as spam (unsolicited communications for marketing purposes). In a trusted social network, push features become a convenient mechanism to transfer files between users connected by a relationship characterized by trust.
The process of implementing a push feature in a social P2P network is similar to that of synchronization, as discussed above. The main difference is the introduction of a push server that controls the flow of information and enforces preset rules, which are unique to the push feature.
As a result, users on a social network can send files to their trusted peers in a controlled manner. The uniqueness of this type of feature is that it allows object transfer without the need for the receivers to search for the push object. Once the push object has been received, changes to the object could be managed using the synchronization system, as described above.
The proposed network is not limited to the sharing of electronic resources such as electronic files but creates new work processes for the user. The following are provided for exemplification purposes only and are not intended to limit the scope of the invention described in broad terms above.
EXAMPLE 1A
File Sharing on a Trusted Social Network This example describes the process of file sharing on a trusted social network.
-
- a) Authentication and Authorization User A 1 has a list of files, namely File A-1 60 on a shared folder. User A 1 must first be identified and receive authorization from the trusted servers 3 in order to access the network.
- b) Trusted peer of User A can access File A-1 A trusted peer for A 1, in this case User B 9, who is already authorized to be on the system can now access File A-1 60.
- c) Socially related users can access Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access File A-1 60 depending on the permission first declared by User A 1. For example, User A 1 can limit the degree of separation (n) for which the file can be accessed.
- d) Non socially related users cannot access Users on the network that do not have a social connection to Users A 1 or B 9, in this case User X 90, cannot have access to File A-1 60.
This example assumes that all users are connected to the Internet without limits on network access such as firewalls. The use of proxies on trusted servers is necessary when there are limits to network access. This scenario is discussed, for example, in the above section entitled Delivery Through Relay.
EXAMPLE 1B
Photo Sharing on a Trusted Social Network This example describes the process of sharing digital photographs on a trusted social network. Digital photographs are a specific example of file transfer that involves file sizes ranging from kilobytes to megabytes.
-
- 1. Authentication and Authorization User A 1 has one or more digital photograph file 80 on a computing device connected to the network. User A 1 must first be identified and receive authorization from the trusted servers 3 in order to access the network.
- 2. Trusted peer of User A can access A trusted peer to A 1, in this case User B 9, who is already authorized to be on the system can now access the photograph file 80.
- 3. Socially related users can access Any connected user that is related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access the photo 80 depending on the permission first declared by User A 1. For example, User A 1 can limit the degree of separation (n) for which the photograph file 80 can be accessed.
- 4. Unrelated users cannot access Users on the network that do not have a social connection to Users A 1 or B 9, in this case User X 90, cannot have access to the photograph file 80.
This example assumes that all users are connected to the Internet without limits on network access such as firewalls. The use of proxies on trusted servers is necessary when there are limits to network access.
EXAMPLE 1C
Video Sharing on a Trusted Social Network This example describes the process of sharing digital videos on a trusted social network. Digital videos are a specific example of rich media file transfers that involve extremely large files ranging from megabytes to gigabytes in size.
-
- 1. Authentication and Authorization User A 1 has one or more digital video files 120 located in a shared folder. User A 1 must first be identified and receive authorization from the trusted servers 3 in order to access the network.
- 2. Trusted peer of User A can access A trusted peer of User A 1, in this case User B 9, who is already authorized to be on the system can now access the video file 120.
- 3. Socially related users can access Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access the video file 120 depending on the permission first declared by User A 1. For example, A 1 can limit the degree of separation (n) for which the video can be accessed.
- 4. Unrelated users cannot access Users on the network that do not have a social connection to Users A 1 or B 9, in this case User X 90, cannot have access to video file 120.
This example assumes that all users are connected to the Internet without limits on network access such as firewalls. The use of proxies on trusted servers is necessary when there are limits to network access. This scenario is discussed, for example, in the above section entitled Delivery Through Relay.
EXAMPLE 1D
Remote Access and File Sharing on a Trusted Social Network This example describes the process of remote access of the client to share digital videos on a trusted social network. The process by which a user can access the system remotely is discussed elsewhere. Once the system authorizes the remote access, the user can then carry out all the activities that are permitted on the network.
-
- 1. Authentication and authorization for remote client User A 1 must first establish a communication channel between the remote device 2 and the software client 6. The software client 6 will issue a challenge and User A 1 must then complete the logon steps to gain access to the software client. Once the logon process is successful, User A 1 can then issue commands to the software client 6 through the remote device 2.
- 2. Authentication and Authorization User A 1 starts and completes the logon process for the software client 6 and the trusted servers 3. User A 1 has a file 120 on a shared folder.
- 3. Trusted peer of User A can access A trusted peer for A 1, in this case User B 9, who is already authorized to be on the system can now access the file 120.
- 4. Socially related users can access Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access the video depending on the permission first declared by User A 1. For example, A 1 can limit the degree of separation (n) for which the file 120 can be accessed.
- 5. Not socially related users cannot access Users on the network that do not have a social connection to Users A 1 or B 9, in this case User X 90, cannot have access to the file 120.
This example assumes that all users are connected to the Internet without limits on network access such as firewalls. The use of proxies on trusted servers is necessary when there are limits to network access. This scenario is discussed, for example, in the above section entitled Delivery Through Relay.
EXAMPLE 1E
Editing Files Collaboratively on a Trusted Social NetworkIn this example, User A first creates a source file involving a trusted peer (User B) and User B's trusted peer (User B1). User A can create a source file using any type of software (e.g. Microsoft Word, WordPerfect, Open-Office, Excel, PowerPoint, Adobe Premier, Apple Quick time, etc.) and in any type of format (e.g. text, graphic, audio or video). User A then saves the file in a folder that is designated as a shared folder. User A marks the file with the appropriate access permissions such as the degree of separation of users able to view or edit the file. Users other than User A are not permitted to delete the file. Access permissions are relayed to an editing server. The editing server sends a message to User A's trusted peers (such as User B) that there is a collaboration file available. Trusted peers of User A within the appropriate degree of separation can access the collaboration file from User A through the network. When authorized users attempt to edit the file, a message is sent to the editing server that this file is being edited. The editing server checks whether the file is the latest version. If the file a user is attempting to edit is not the latest version, the user is given an option to update to the latest version. The user can then proceed to edit the file using local resources. While the file is being edited, the editing server will not allow another user to edit the file. Once the user has finished editing the file, the user sends a message to the editing server. The editing server then releases the lock on the file so that other users can edit the file. The editing server labels the new version of the file as the latest version and notifies other users who have been granted access to the file that a new version is available. Access to and editing control over the file is controlled by User A. For example, User A sets the permission so that the trusted peers of User A's trusted peers can also access the file (i.e. n=1). In this case, User B, a trusted peer of User A, can edit the file. User B1, a trusted peer of User B, but not necessary a trusted peer of User A, can also edit the file. User B1 obtains information of the existence of a collaboration file either directly (through a message from User B) or indirectly (through a search of the network). User B1 can then download the latest versions of the collaboration file from sources that have the latest version. User B1 now can edit the file unless another user is already editing the file as described above.
EXAMPLE 1F Sharing Bookmarks and World Wide Web Links on a Trusted NetworkIn a more specific example of collaboration, User A uses a trusted Peer-to-Peer network to create and share a series of bookmarks and World Wide Web (WWW) links. User A first defines a collection of bookmarks or WWW links that they want to share with their trusted peers. User A then marks the collection of bookmarks with the appropriate access permissions, in this case N=0. User A further decides that other users can add to the bookmark collection but may not delete from the collection, nor delete the collection entirely. Access permissions for the collection are relayed to the editing server. The editing server sends a message to User A's contact list that there is a collaboration collection of bookmarks available. Trusted peers of User A within the degree of separation of N=0 can obtain the bookmarks from User A through the trusted network. Authorized persons can add to this collection as follows: A user accesses the collaboration collection of bookmarks and wants to contribute to the collection. A message is sent to the editing server that a user wants to contribute to the bookmark. The editing server checks whether the bookmark file is the latest version of the collection. If it is not the latest version, the user is given the option to update. Since the permission for the collection is addition only, there is no need to lock the collection while it is being edited. The user can proceed to edit the collection of bookmarks. Once the update is finished, the user sends a message to the editing server. The editing server updates its information on the latest version of the collection. Users within the network can access and contribute to this collaboration collection of bookmarks depending on the access permission provided by User A.
EXAMPLE 1G
Synchronization in a Trusted Network In this example, the following groups of trusted peers have various degrees of separation from User A (expressed as values of “n”):
User A wishes to synchronize a synchronization object with other trusted peers. The object can be any type of digital file and may comprise entire folders or directories. User A first defines the synchronization object using the client software. User A also enters a description of the object and the degree of separation required to access the object (in this case, n=1). The client software sends a message to the synchronization Server that includes at a minimum a description of the object and the degree of separation needed to access the object. Users of the network who fall within the criteria defined by User A (n=1) receive a message from the synchronization server informing them that User A has created a synchronization object that they can either accept or reject. If the users accept the synchronization object, they can obtain the object from User A or from other users within User A's trusted network that have the most recent version of the object. Each user that has the object can then invite their trusted peers to download the object. This process can continue throughout the social network. The synchronization server compiles a list of users on the network who possess copies of the synchronization object. Once a list of synchronized users is created, whenever one of the users makes changes to the object; it will trigger the preset rules of behavior for the synchronization server for that particular change. For example, User B adds a file to Folder A in User B's local shared directory. A message is sent to the synchronization server notifying it there a new synchronization object has been added. The synchronization server then sends a message to all members that have that object and notifies them of the new addition. As a result, User A, C and B1 can download the latest addition from User B. Users A, C or B1 can also become a source of the new file. Other trusted peers that are within the set degree of social separation can also obtain the object. These trusted peers must search for the object through the network rather than receiving a message notification of the synchronization server. For example, User C1 can search and download the object because User C1 is n=1 degree of separation from User A. Trusted peers of User E1 cannot find object because User E1 is n=2 away from A.
EXAMPLE 1H Synchronization as Broadcasting In this example, the initiator of the synchronization object retains the rights to modify the object while all other trusted individuals can duplicate the object but cannot modify it. In this example, the synchronization feature functions in a fashion that is analogous to broadcasting. In this example, User A has the following groups of trusted peers that have various degree of separation from the A (expressed as a value of “n”).
User A creates a synchronization object using the client software. User A also enters a description of the object, the degree of separation required to access the object (in this case, n=1) and defines this object as the “Master synchronization object”. The client software sends a message to the synchronization server including this information. All of the trusted peers of User A receive a message from the synchronization server that asks them if they wish to accept the object. If they accept, these users can obtain the object from User A or anyone on User A's list that has the most recent version of object. In this example, User A has trusted peers B, C, D and E. Users B, C, D, and E receive a message from the synchronization server identifying the fact that User A has a synchronization object available. Users B and C accept the object. User B then downloads the object from User A first. Once B has downloaded some portion of the object, User C can download the object from either User B and/or User A. Users D and E do not accept the file and will not be contacted again with regard to this object. Depending on the initial settings of the synchronization object for the degree of separation, each user that has the object can invite their trusted peers to download the object. Their trusted peers can, in turn, also invite their trusted peers if the object. Once the initial dissemination of the synchronization object is complete, the synchronization server compiles a list of trusted peers that have the object. Whenever User A makes changes to the object, it will trigger the rules of behavior for the synchronization server for that particular change. When this occurs, the synchronization server notifies the users on its list that a new version of the synchronization object is available for download. Only changes from User A will trigger updates to other owners of the object. Users wishing to be deleted from the synchronization list can send instructions to the synchronization server.
EXAMPLE 11
Using Synchronization as BackupIn this example, the initiator of the synchronization object uses the synchronization feature as a means of backing up files on a computer. User A defines a folder (“Backup”) on his computer as a sync object. User A wants to back up this folder on the hard drive of his trusted peers, Users B and C. The synchronization server contacts B and C and asks them if they are will accept A's request. When Users B and C accept User A's request, folder (“Backup”) is copied to the hard drive of Users B and C respectively. User A can set the properties for the Backup folder so that objects in the folder are updated every time the folder is changed. User A can also specify that the Backup folder is locked and that Users B and C cannot access the contents of the Backup folder on their local disk. This could be accomplished, for example through the use of encryption or password protection. This system is possible without lengthy negotiation because a relationship of trust already exists between Users A, B and C.
EXAMPLE 2
An Electronic Market on a Trusted Social NetworkThe present invention can also be used to setup an electronic marketplace for digital goods. Such markets are created when the system can assign an explicit value to the transactions between users on their trusted social network. Markets differ in the information being tracked when an item is transferred between two users. For markets based on transactions, the system automatically assigns value based on the interaction between two socially related users. For market based on transfer of digital right, an additional service, known as a digital rights manager, is required to track the legitimate ownership of a particular piece of content. A natural extension of this concept is in the transfer of non-digital goods. The following systems are not mutually exclusive and can be used in conjunction with each other.
EXAMPLE 2A
Market Based on Transactions
-
- 1. Authentication and Authorization User A 1 has an item 130 on a shared folder. User A 1 must first be identified and receive authorization from trusted servers 3 to access the network.
- 2. Trusted peer of User A request and obtain item A trusted peer, for example User B 9, who is already authorized to be on the system and is defined by User A 1 to be a trusted peer, can now negotiate the purchase of item 130 from User A 1. This transaction is recorded in an accounting service 140 on the local machine for both Users A 1 and B 9.
- 3. Socially related users access Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also negotiate the purchase of the item 130 depending on the permission first setup by User A 1 and subsequently, all the other related users. This transaction is also recorded in an accounting service 140 on the local computing device of User A 1 and User Bn 70.
- 4. Transaction information For each user, the local accounting service reports the transaction information to the accounting server 150 on the trusted servers 3. The accounting server 150 can then assign values to each transaction. Examples of transaction information include, but are not limited to file type, file size, speed of transfer, value of transfer, user satisfaction. Examples of assign values for transactions include, but are not limited to, cash or system credits.
An electronic market is thereby created which assign value to an activity over the network.
EXAMPLE 2B Market Based on Transfer of Digital Rights
-
- 1. Authentication and Authorization User A 1 is the digital rights holder of an item (such as a digital music file protected by copyright) 120 on a shared folder. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
2. Initial DRM information User A 1, sends the Digital Rights Management (DRM) 165 information to the DRM server 160.
3. Trusted peer of User A can request and obtain item. A trusted peer of User A 1, defined as User B 9, who is already authorized to be on the system can now obtain the item 120 from User A 1 once any necessary negotiations regarding rights have been concluded.
4. Socially related users can access Any connected users that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also obtain the item 120 depending on the permission first setup by User A 1 and subsequently, all the other related users. The DRM information 165 is sent to the local digital rights manager 160 installed on the local system 170.
5. Digital rights information For each user, the local accounting service 140 reports the digital rights information to the DRM Server 160 on the trusted servers 3. The DRM Server 160 can then assign the appropriate access rules and regulation governing the use of the item as defined by the digital rights owner, namely User A 1.
The addition of a DRM server can therefore effectively enforce copyrights in digital files in a flexible and effective manner throughout the network. The social element of this network provides an additional level of security and enforcement for transactions involving digital rights.
EXAMPLE 2C Extension of Electronic Market to Identifiable Non-Digital Goods An electronic market built on a trusted social network as described herein can also be used for the trading of non-digital goods. This embodiment describes the use of the electronic market to exchange non-digital goods. Additional requirements to implement this example are the availability of a unique identifier for the object of interest and a Rights Management (RM) server. Examples of unique identifiers include but are not limited to the following: manufacturer's serial numbers, Radio Frequency Identification (RFID) tags and/or Universal Product Code (UPC). The RM server will manage the rules and regulations governing the ownership of the object including copyright, licenses, assignments and the like.
-
- 1. Authentication and Authorization User A 1 is the owner of an item 120 that can be identified uniquely by means of an identifier 165. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- 2. Owner's rights information User A 1 sends the unique identifier 165 and ownership information 165 to the Rights Management (RM) server 160.
- 3. Trusted peer of User A can access A trusted peer, defined as User B 9, who is already authorized to be on the system, can now request the item from User A 1.
- 4. Socially related users can access Any connected users that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also request the item 120 depending on the permission first setup by User A 1 and subsequently, all the other related users.
- 5. Delivery of Item In this example, User A 1 accepts the request of User Bn 70 and delivers the item 120 together with its unique identifier 165. The item 120 can be delivered an external process for example: mail, courier service or direct delivery.
- 6. New owner's rights information Once User B1 70 receives the item, rights information is sent back to RM server 160 to conclude the transaction.
The addition of a RM server can therefore effectively enforce ownership in a flexible and effective manner throughout the network. The social element of this network provides an additional level of security and enforcement for transactions involving non-digital goods.
EXAMPLE 3C Banking Services on a Trusted NetworkIn this example, the following groups of trusted peers have various degrees of separation from User A (expressed as values of “n”):
User ID summary
A user (User A) on a trusted network decides that he or she wants to be a lender. User A sends a message to the banking server containing information such as: the maximum amount of money the user is willing to lend, the desired interest rate for the loan, the repayment period and the degree of separation within which the user is willing to lend money. These preferences could be expressed as ranges to allow for negotiation between lender and borrower.
Lender summary table
User B decides that he wants to borrow money. The user sends a request to the banking server with information such as the amount of money that he requires, the interest rate that he is willing to pay, the loan period and the degree of separation within which he is willing to borrow money (Bn). Again, these preferences could be expressed in terms of ranges to allow for negotiation.
Borrower summary table
The banking server receives the request from User B and consults its database of lenders. In this example, the primary determinant is the degree of separation; followed by the desired interest rate.
All members that are n=2 or less away from B and is willing to lend money to B.
Applying the second criteria, that lenders must be willing to accept a lending rate less than or equal to the desired interest rate of User B.
The resulting list of lending candidates that satisfy the preferences are sent back to the borrower. For example:
User B can now decide how to mix and match the loans to meet his desired $500 total. In this example, he chooses:
This information is sent back to the banking server, which then establishes a dialogue between lenders and borrower. The banking server sends a message to each of the lenders that a user on the network has met their lending criteria and has requested money. The lender can either accept or decline the offer.
For this example, User A receives a message from banking server that a user wishes to borrow $100 at 5% for 6 months. User A2 also receives a message from banking server that a borrower wishes to borrow $400 at 7% for 12 months. Users A and A2 each have the option to accept or decline the request.
If the lender accepts the request, they receive more information on the request for money and are prompted for the terms and conditions of the loan. The lender then authorizes the money transfer to borrower. The borrower receives the money and the Bank Server starts tracking the time and interest payments. Conditions for account delinquency are pre-defined. Examples of delinquency conditions include: missed payments, frequent late payments or refusal to pay. If delinquency conditions are met, the Bank Server will carry out enforcement which may include temporary or permanent ejection from the network, alteration of reputation status, or other enforcement means as determined by the administrators. The lender also has recourse to all normal means of collection and enforcement under the law. However, given that the lenders and the borrowers are linked by a pre-existing relationship of trust, delinquency is less likely to occur than in financial relationships between strangers, due to the resulting harm to the social relationship. Once all payments are made, the loan is considered to be finished.
EXAMPLE 3A Normal Auctions on a Trusted Social NetworkThe trusted social network as outlined herein can also be used as the basis for different types of auctions.
In a normal auction there are a single seller and many potential buyers bidding for the item being sold. On a trusted social network as described herein, the buyers are limited to the extended social network of the seller.
-
- 1. Authentication and Authorization User A 1 is the owner of an item 120 for auction on the network. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- 2. Starts auction process User A 1 initiates the auction process by sending the appropriate information to an Auction server.
- 3. Trusted peer Bidding A trusted peer, defined as User B 9, who is already authorized to be on the system can now obtain the auction information concerning the item 120 from the auction server 160. Any other users that are related to A 1 or B 9 can also access this information through defined social relations.
- 4. Auction information sends to auction server Any connected users that are related to User A 1 or User B 9 can bid on the item 120 by contacting the auction server 160. The auction server can enforce such rules as the time limit for auction, the price limit for item, volume discounts, and exclusions (for example, based on location, reputation, etc.)
- 5. The auction server 160 maintains control of the auction process until the auction is finished.
- 6. Winning bid The auction server notifies both User A 1 and the winner of the result of the winning bid. In this case, User Bn, 70 has the winning bid.
- 7. Delivery of item Once payment has been authorized, the owner of the item, User A 1, can then deliver the item to the winner, User Bn 70. Verification of payment and delivery can be managed via the trusted servers 3.
The auction system can also support reverse auctions. In a reverse auction there is one buyer and many sellers. The buyer specifies what they want to purchase and offers it to many suppliers. Normally, each buyer must be qualified to ensure that the winner is suitable to the buyer. As a result this type of process will usually produce the lowest possible price when all sellers are of equal quality. Qualification is implicitly defined in a social network since access to the network is by invitation only. Therefore, this type of network is suitable for carrying out reverse auctions. An example of a reverse auction is shown in
-
- 1. Authentication and Authorization User A 1 has a request for an item 120 that might be on the network. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- 2. Starts auction process User A 1 initiates the auction process by sending the appropriate information to an auction server 160 requesting the item.
- 3. Trusted peer Bidding A trusted peer, defined as User B 9, who is already authorized to be on the system can now obtain the auction information concerning the request from the auction server 160. Any other users that are related to Users A 1 or B 9 can also access this information through defined social relations.
- 4. Auction information sent to auction server Any connected users that are related to User A 1 or User B 9 can bid to satisfy the demands of User A 1 by contacting the auction server 160. The auction server can enforce such rules as the time limit for auction, the price for item, any volume discounts and conditions for acceptance (for example, based on location, reputation, etc.)
- 5. The auction server 160 maintains control of the auction process until the auction is finished.
- 6. Winning bid The auction server notifies both User A 1 and the winner of the result of the winning bid. In this case, User Bn 70 has the winning bid.
- 7. Delivery of item Once payment has been authorized, the owner of the item, User Bn 70, can then deliver the item 120 to the requesting user, User A 1. Verification of payment and delivery can be managed via the trusted servers 3.
The network according to the present invention represents a platform that can support a myriad of communication services. Example 4 lists various communication services that can be implemented on a trusted social network.
EXAMPLE 4A Instant Messaging (IM) Instant messaging (IM) is a real-time text-based message protocol over the Internet between two or more people who must all be online at the same time.
-
- 1. Authentication and Authorization. User A 1 wants to communicate with a trusted peer. User A 1 logs in to the system and undergoes a process of authentication and authorization.
- 2. IM process (direct). Once on the network, User A 1 can communicate with those trusted peers that are also on the network, in this case, User B 9. User A 1 can also contact anyone that is socially related to the User B 9, for example, User Bn 70, depending on their mutual preference settings.
- 3. IM through proxy. In some cases, Users are behind firewalls or other security devices and cannot be connected directly. In such cases, the IM service is available through the IM server 160 on the trusted servers 3.
Voice over Internet Protocol is a technology for transmitting telephone calls over the Internet using packet-linked routes.
-
- 1. Authentication and Authorization. User A 1 wants to communicate with a trusted peer via VOIP. The user logs in to the system and undergoes a process of authentication and authorization.
- 2. VOIP process (direct). Once on the network, User A 1 can communicate using VOIP, with those trusted peers that are also on the network, in this case, User B 9. User A 1 can also contact anyone that is socially related to the User B 9, for example, User Bn 70, depending on their mutual preference settings.
- 3. VOIP through proxy. When Users are behind firewalls or other security devices and cannot be connected directly. In such cases, the VOIP service is available through the VOIP server 160 on the trusted servers 3.
- 4. VOIP to POTS. This service can be extended to include traditional telephony (POTS) systems 170. In this case, User C 11, must have some unique identifier (for example, telephone number, password) 165 that allows the user to access the network and be contacted by trusted peers. VOIP communication from User A 1 to User C 11 is through the VOIP server 160.
Interactive or streaming video is a technology for video communication using the Internet.
-
- a) Authentication and Authorization User A 1 wants to communicate with a trusted peer via video. User A 1 first logs in to the system and undergoes a process of authentication and authorization.
- b) Video (direct) Once on the network, User A 1 can communicate using video streams 180, with those trusted peers that are also on the network, in this case, User B 9. User A 1 can also contact anyone that is socially related to the User B 9, for example, User Bn 70, depending on their mutual preference settings.
- c) Video through proxy When Users are behind firewalls or other security devices and cannot be connected directly. In such cases, the interactive service is available through the Video server 160 on the trusted servers 3.
In this example, User A has the following groups of trusted peers that have various degrees of separation from User A (expressed as values of “n”).
Users have the option of designating a folder that can receive push objects. A push object can be any type of digital file such as a text file, an executable program file, a graphic file, a video file, etc. Users can also set the preferences for this file folder. In this example, the preferences set by the users are the maximum size of files that the user wants to receive, the file type, the maximum degree of separation of the sender from the User in order to accept a push object.
In this example, each user assigns the following properties to their folder.
User A has a 75 MB avi file that she wants to send to some of her trusted peers and people that are one degree of separation away from her (n=1). User A sends a request to the Push server defining the file as a push object to be sent to people that are n=1 away from User A. In this case, User A also specifies the trusted peers to whom she wants to send the file. In this case, User A picks Users B, C, D, E, and F but not User G.
The push server checks the permissions for the temp folder and asks each designated user whether they want to receive the file. If the answer is no, these users will not be contacted regarding this object again. If the answer is yes, the users may obtain the file from User A or anyone of A's trusted peers that also have the file.
In this case,
Users C and D accept the push object but User E rejects the file. Users C and D can receive the push object from User A. As soon as Users C and D receive portions of the push object, they can then be a source for the push object. The push object can be distributed to other members of the social network until the degree of separation as defined by the creator of the object is met.
Because User A has set the push object properties as n=1, Users C and D have the option of sending the push object to their trusted peers. In this case, User C does not authorize a message from the push server to be sent to User C's trusted peers. As a result, Users C1, C2 and C3 will not receive the push object.
User D chooses trusted peers D1 and D2 as recipients for the push object. The push server checks the access permissions for D1 and D2 before contacting them about the push object. In this case, User D1 gets a message but not User D2 because User D2 set its folder to only accept files that originate from User D2's trusted peer (n=0) and not User D2's trusted peer's trusted peer.
It is possible for Users D1 or D2 to send the file to their trusted peers but only if Users D1 and D2 re-initiate the push object as their own push object. In this example, after the push process initiated by User A, the following users will have the push object.
Content syndication describes the process of making portions of web content available for use by other services. The syndicated content, or feed, can consist of both the content itself and information about the content (metadata). RSS is a XML content syndication standard that provides an XML-formatted feed consisting of an abstract of content and a link to a document containing the full content. As an application, it is part of the Resource Description Framework (RDF), which are specifications that provide a lightweight ontology system to support the exchange of knowledge on the web. In general, these technologies are found in the context of a web environment and have not been applied in P2P networks. The push functionality described above allows for content feeds to be distributed through a P2P network.
EXAMPLE 5 Resource Sharing Through a Trusted Social NetworkThe application of the present invention is not limited to the communication or the transfer of electronic files but can also extend to the sharing or grouping of resources both electronic and non-electronic. The common element in the resource sharing through a social network is the addition of a trusted source that manages the resources. The following are representative examples of resource sharing on this type of network.
EXAMPLE 5A
Electronic Resource Sharing on a Trusted Social Network This example applies to the sharing of electronic resources available on the local computing device that can include but not limited to: bandwidth, storage capacity and CPU processing capability.
-
- a) Authentication and Authorization. User A 1 has resources 120 to share, in this case, local hard drive space. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- b) User A 1 sends information on resource availability. Once authenticated User A 1 sends resource information to the resource manager 160 residing with the trusted servers 3.
- c) Trusted peer can access. A trusted peer, for example User B 9, who is already authorized to be on the system and is defined by User A 1 to be a trusted peer, obtains information from the resource manager 160. User A 1 and User B 9 can now share their resources 120 accordingly.
- d) Socially related users can access. Any connected user that is related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also share their resources 120. The resource manager 160 carries out the organization and management of those resources.
- e) Resource information. For each user, the local resource service 190 reports the available resource information to the resource manager 160 on the trusted servers. The resource manager 160 can then allocate resources to each user of the trusted network accordingly.
As a result, resources can be grouped and shared on a trusted network according to the preference of each individual user.
EXAMPLE 5B Non-Electronic Resource Sharing on a Trusted Social Network with Delivery Through a Trusted Service The application of the present invention is not limited to sharing or grouping of electronic resources but also includes identifiable non-electronic resources. Examples of non-electronic resources include: money, credit and/or information.
-
- a) Authentication and Authorization User A 1 has a resource 120 to share, in this case, money. User A 1 must first be identified and receive authorization from trusted servers 3 to access the network.
- b) User A 1 contributes resource to a central authority Once authenticated User A 1 sends the resource (money) 120 to the trusted authority 200 and the information related the resource to the resource manager 160.
- c) Trusted peer resource contribution A trusted peer, for example User B 9, who is already authorized to be on the system and is defined by User A 1 to be a trusted peer, can contribute to or use the resource 120 on the trusted authority 200. With each contribution, the corresponding resource information is also sent to the resource manager 160. User A 1 and User B 9 can now share their resources 120 accordingly.
- d) Socially related users access request resources Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also share and request the resources 120. In this case, the User Bn 70 requests the resource 120 and the resource manager 160 carries out the organization and management of those resources and arranges for the delivery of the resource 120.
- e) Resource delivery The resource manager 160 arranges for the delivery of the resource 120 to User Bn 70 from a trusted authority 200.
- f) Resource information For each user, the local resource service 140 reports and tracks the contribution of each socially related user. The resource server 160 can then allocate resources 120 or provide access privileges to each user of the trusted network accordingly.
As a result, resources can be grouped and shared on a trusted network according to the preference settings for each individual user.
EXAMPLE 5C Non-Electronic Resource Sharing on a Trusted Social Network—Delivery by a Trusted Peer In this example of sharing of non-electronic resources, a trusted peer carries out the delivery of the resource.
-
- a) Authentication and Authorization User A 1 has a request for a resource 120, in this case, money. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- b) User A submits a resource request Once authenticated, User A 1 submits a resource (in this case money) request to the to the resource manager 160, a trusted authority.
- c) Resource query Resource manager 160 then queries each of the trusted peers of User A 1 to find the resource. In this case, User B 9 is query and the system finds that User B 9 does not have the required resources 120.
- d) Request accepted Any connected peer that is related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also reply to the request for resources. In this case, the User Bn 70 has the resource 120 and the resource manager 160 carries out the organization and management of those resources and arranges for the delivery of the resource 120.
- e) Resource delivery The resource manager 160 closes the request after the delivery of the resource 120 from User Bn 70 to User A 1.
As a result, resources can be grouped and shared on a trusted network according to the preference of each individual user and the delivery of the resources does not have to occur via a trusted intermediate.
EXAMPLE 5D Information Collaboration and Management On a Trusted Social Network Information is one particular type of resource that is ideally suited to be accessible and available on a trusted social network. In order for information to be useful and relevant, it must be written and organized for an intended audience.
-
- a) Authentication and Authorization. User A 1 requires updating information 120 that is being stored in a central trusted authority, an editing server 160. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- b) Information contribution. Once authenticated User A 1 submits the new information 125 to the editing server 160.
- c) Trusted peer information contribution A trusted peer, User B 9, who is on the network can query the editing server 160 or contribute additional information 125.
- d) Socially related user request information Any connected user that is related to User A 1 or User B 9, and who falls within the designated degree of separation, in this case, Bn 70 (n representing the degree of separation from User B 9) can also edit or view the information 120. In this case, the User Bn 70 submits a query to the editing server 160.
- e) Information is delivered The editing server 160 response to the query based on the rules and regulation governing the information 120.
- f) Resource information The editing server 160 is connected to each user of the trusted social network to ensure each user has the appropriate access to the information 120.
As a result, information can be edited, manipulated, grouped and shared on a trusted network according to the preference of each individual user. The uniqueness of this type of collaboration is that social relationships dictate function rather than requiring a central authority to manage user access to resources.
EXAMPLE 6 Electronic Games on a Trusted Social Network An application of the present invention can be used to allow users of a trusted Peer-to-Peer network to play electronic games via the network. Since most games are played between friends, the trusted social network becomes a natural electronic extension of the real world. Many on-line games allow players to organize into “clans” or “guilds” for cooperative or team play. The trusted Peer-to-Peer network can be applied to facilitate such organization. Examples of games include, but are not limited to, the following: poker, chess, scrabble, real time strategy games, first person shooter games, multi-player role playing games and the like.
-
- a) Authentication and Authorization User A 1 wants to play a game 120 with one or more users or groups of users. User A 1 must first be identified and receive authorization from trusted servers 3 to access the network.
- b) Trusted peer access A trusted peer, for example User B 9, who is already authorized to be on the system and is defined by User A 1 to be a trusted peer, can then play with User A 1.
- c) Playing as a group Any connected users that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also play the game 120 as an individual or as a group. A game server 160 can be a central organizer for some types of games.
- d) Through a proxy In cases where there is a firewall or other forms of security, trusted peers, the game server 160 can function as a proxy to establish connection between users.
- e) Directly to a game server For complex games such as those found in on-line multi-player games, authenticated users can connect directly to the game server 160. In this case, the social network relationships are still maintained as each user plays the game.
The present invention can be applied to advertising directed towards individual users of the network.
-
- a) Authentication and Authorization User A 1 wants to broadcast a message 120.
Examples of the message 120 include but are not limited to: a text message, a URL, a graphic or a multimedia file. User A 1 must first be identified and receive authorization from trusted servers 3 to access the network.
-
- b) Advertising message User A 1 sends a request to advertise through the social network to the advertising server 160.
- c) Trusted peer advertisement Once authorized by the advertising server 160, User A 1 can send a message to a trusted peer who is on the network, in this case, User B 9.
- d) Socially related user advertisement Message 120 can also be sent to any user that is socially related to A 1 or B 9, in this case, User Bn 70.
- e) Advertising information Advertising controls, for example, length of display or type of message is sent to each user. Advertising information, such as duration of the ad, click-through, etc. is sent back to the advertising server.
This example illustrates the ability to create a direct marketing campaign to users of a social group using the present invention.
EXAMPLE 8 Example of Business ApplicationsAccording to one embodiment of the present invention, a social Peer-to-Peer network can also be applied in a business environment. The essential nature of the network does not change but the terminology describing the elements of the network might be modified depending on context. For example, in a business setting, the social network is related to a collection of roles within an organization with the trusted relationship between users being defined as a result of those roles. The following examples illustrate applications of the present invention in a corporate setting.
EXAMPLE 8A Multilevel Marketing (MLM) Multi-level marketing (MLM), also known as network marketing (NM), affiliate marketing, or home based business franchising, is a business model that combines the characteristics of direct marketing and franchising. Typically, individuals enter into an independent contractor relationship with a business entity and act as sellers and agents to recruit others to work for the company. New recruits are, in turn, encouraged to recruit others to work for the company. Sellers are compensated based on their sales of a product or service, as well as the sales of those they bring into the business.
-
- a) Authentication and Authorization User A 1, represents an agent for a MLM business and wants access to the trusted network. User A 1 must first be identified and receive authorization from trusted servers 3 to access the network.
- b) MLM request Once authenticated, User A 1 can then send a request to the MLM server 160. The MLM server 160 is a trusted entity that controls the rules and regulations specific to this business.
- c) First levels recruit access User A 1 can now interact with a trusted peer who is on the network, in this case, User B 9. In this context, User B 9 is known as a first level recruit because this user is directly related User A 1.
- d) Downline information User Bn 70, is lower in the hierarchy relative to User A 1 and B 9 because User Bn 70 was recruited by agents related to User A 1 and B 9 in some way. Because of this relationship, User A 1 has rights to the MLM activities of User Bn 70.
- e) MLM activity information MLM activities 120, for example, sales information, support are provided via a connection to the MLM server 160. Local MLM software 140 on each User's computing device processes this information. The MLM server 160 can also implement specific business rules based on such factors as the percentage of sales of users, sales volume discounts and limiting the number of users.
Film production is a complex process that requires the efforts of groups of individuals including: editors, sound engineers, cinematographers, etc. The process of movie production can be carried out on a social Peer-to-Peer network according to one embodiment of the present invention.
-
- a) Authentication and Authorization User A 1 has a movie in production. In this case, an electronic copy of the film 120 exists on his local machine. In order to use the network, User A 1 must first be identified and receive authorization from trusted servers 3 to gain access.
- b) Film availability Once authenticated User A 1 sends film information 120 to the film manager 160 residing within the trusted servers 3.
- c) Trusted peer access A trusted peer, for example User B 9, who is already authorized to be on the system and is defined by User A 1 to be a trusted peer, obtains information from the resource manager 160. User A 1 and User B 9 can now both work on the film 120 accordingly. User B 9 can then delegate responsibilities and access to the film 120 independent from User A 1. This is because the network is built based on the principle that there is trust between User A 1 and User B 9.
- d) Process defined users Any connected user that is related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access the film 120. The film manager 160 carries out the organization and management of this resource.
- e) Resource information For each user, the local resource service 140 reports the available resource information to the resource manager 160 on the main trusted servers 3. For example, the film manager 160 can implement version control, so only one copy of a film 120 is in production. The film manager 160 can then allocate resources to each user of the trusted network accordingly.
As a result, resources can be grouped and shared on a trusted network according to the preference of each individual user.
EXAMPLE 8C Film Festivals A film festival is a periodic gathering of individuals with a common objective of showcasing films according to some common theme.
-
- a) Authentication and Authorization User A 1 has a video file (film A-1) 120 on a shared folder. User A 1 must first be identified and receive authorization from the trusted servers 3. User A 1 could be a user of the film festival or an audience member.
- b) Trusted peer access A trusted peer of A 1, in this case User B 9, who is already authorized to be on the system can now access film A-1 120.
- c) Socially related users access Any connected user that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also access film A-1 120 depending on the permission first setup by User A 1.
- d) Not socially related users Users on the network that do not have a social connection to A 1, for example, User X 90, cannot have access to film A-1 120.
When a film festival uses this network, they can distribute content over the available bandwidth of each trusted peer while taking advantage of the growth opportunities of a social network.
EXAMPLE 8D Medical Industry The present invention can also be used in the medical industry for diagnostic and collaboration. An example such an application is provided in
-
- a) Authentication and Authorization User A 1 requires updating information 120 that is being stored in a central trusted authority. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- b) Medical Information contribution Once authenticated User A 1 submits the new information the trusted authority, a manager server 120.
- c) Trusted peer information contribution A trusted peer, User B 9, who is on the network can query the manager server 160 or contribute additional information 120.
- d) Related user request information Any connected user that is related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also edit or view the information 120. In this case, the User Bn 70 submits a query to the manager server 160.
- e) Information is delivered The manager server 160 responds to the query is based on the rules and regulation governing the use of the information 120.
- f) Medical information The manager server 160 is connected to each user of the trusted social network to ensure each user has the appropriate access to the information.
As a result, information can be edited, manipulated, grouped and shared on a trusted network according to the preference of each individual user without the need to explicitly request permission from a central authority such as the trusted servers. The role of the trusted server is simply to initially verify the identity of the user.
EXAMPLE 8F Online Movie and/or Music StoreMovies and music are increasingly available in digital format. A new type of delivery mechanism and store can be created according to one embodiment of the present invention. Using Example 2B (an electronic market built on a trusted social network based on the transfer of digital rights) as a model, a film company can deliver a movie over a trusted network. In this case, the DRM (Digital Rights Management) server not only manages the rules and regulations governing the ownership of the object but also can enforce payment. The main components of this system are:
-
- a) Authentication and Authorization User A 1 is the digital rights holder of a movie 120 located in a shared folder. User A 1 must first be identified and receive authorization from the trusted servers 3 to access the network.
- b) Initial DRM information User A 1 sends the Digital Rights Management (DRM) information 165 to the DRM server 160.
- c) Trusted peer of User A requests and obtains item A trusted peer of User A 1, defined as User B 9, who is already authorized to be on the system can now obtain the movie from User A 1. User A 1 must meet the requirements of the DRM server 160. For example, obtaining a valid license to view the movie 120.
- d) Socially related users with a license can access Any connected users that are related to User A 1 or User B 9, in this case, Bn 70 (n representing the degree of separation from User B 9) can also obtain the movie 120 depending on the permissions first set up by User A 1 and subsequently, all the other related users. The digital rights information 165 is sent to the DRM manager 160 to ensure compliance with the rights and regulations governing the use of the movie 120.
- e) Digital rights information For each user, the local accounting service 140 reports the digital rights information 165 to the DRM manager 160. The DRM manager 160 will assign the appropriate access rules and regulation governing the use of the item as defined by the digital rights owner.
A new type of retail store is created based on a social Peer-to-Peer network according to one embodiment of the present invention. Each individual user can act as both consumer and distributor enjoying the benefits of network and efficient distribution.
Claims
1. A system for a plurality of users to share resources comprising:
- one or more software clients, each of said software clients installed on a computing device; one or more trusted servers; one or more communication means allowing communication between said one or more trusted servers and said one or more software clients,
- wherein said trusted servers comprise: a network interface operable to receive data packets from the software clients and further operable to send processed data packets to the software clients; a processing engine in communication with the network interface, said engine operable to associate each data packet with an identifier and to thereby provide said processed data packets; a database containing an identifier associated with each software client in said system, and
- wherein each identifier in said database is related to each other identifier by means of a criterion, wherein said criterion is the degree of separation between one user of a software client and a second user of a software client based on a pre-existing relationship of trust, as defined by said users.
2. The system of claim 1 wherein the resources can be any of the following:
- information, data, computer files, software, hard drive space, or processing power.
3. The system of claim 2 wherein a user can access the system remotely by communicating with the software client via a communication protocol which can include HTTP, telnet, or custom protocols.
4. The system of claim 3 wherein the communication means allows communication between the software clients.
5. The system of claim 4 wherein each user grants access to resources on their computing device to other users within the system who fall within one or more criteria.
6. A system for a plurality of users to share resources, said system produced by the following process:
- a. providing a software client to a first user for installation on a first computing device;
- b. receiving a first set of data packets relating to said first user from said software client to one or more trusted servers via one or more communication means;
- c. compiling a database of said first data packets;
- d. receiving a second set of data packets relating to at least one second user with whom said first user has a pre-existing relationship defined by a criterion, wherein said criterion is trust, as defined by said first and second user;
- e. adding said second set of data packets to the database and relating said second set of data packets to said first set of identifying data by means of said criterion;
- f. providing the software client to the second user for installation on a second computing device;
- wherein, said first, second, or new user can repeat steps b to f resulting in additional users being added to said system.
7. The process of claim 6 wherein the resources can be any of the following:
- information, data, computer files, software, hard drive space, or processing power.
8. A method of searching for information, resources or services contained on a computing device connected to the system of claim 1, based on the properties of the object as well as criteria as specified by the user wherein the search can be conducted either by said software client or be the trusted server.
9. A method for creating a market on a system for a plurality of users to share resources, said method comprising the following steps:
- establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another user based on a pre-existing relationship of trust, as defined by said users; and
- providing a market server connected to said network wherein said computing devices can exchange processed data packets with said market server;
- wherein said processed data packets relate to the buying and selling of goods and wherein said market server coordinates interactions between said users of said computing devices.
10. The method of claim 9 wherein said goods comprises electronic or non-electronic goods.
11. A method for creating an auction on a system for a plurality of users to share resources, said method comprising the following steps:
- establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and
- providing an auction server connected to said network wherein said computing devices can exchange processed data packets with said auction server;
- wherein said processed data packets contain information relating to the designation of objects that are available to be auctioned, and bids for said by one or more of said users; and wherein said auction server manages said processed data packets to manage and regulate auctions on said network according to pre-set rules.
12. A method for playing games via a system for a plurality of users to share resources, said method comprising the following steps:
- establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and
- providing a game server connected to said network wherein said computing devices can exchange processed data packets with said game server; wherein said processed data packets contain information relating to a game in which the users are participants; and
- wherein said game server coordinates and manages the interactions between the users according to pre-set rules.
13. A method for distributing one or more objects to members of a system for a plurality of users to share resources, said method comprising the following steps:
- establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; providing one or more trusted servers connected to said network wherein said computing devices can exchange processed data packets with said one or more trusted servers;
- establishing a list of unique network identifiers corresponding to users who wish to receive the object and the location of a folder on said computing devices of said users designated to receive said one or more objects, said list located on said trusted servers;
- transmitting said one or more objects to said one or more trusted servers with instructions to distribute said object to the members on said list; and
- transmitting said one or more objects from said one or more trusted servers to the members of said list;
14. The method of claim 13 where said one or more objects comprise data, digital information, or one or more electronic files or folders.
15. The method of claim 14, wherein said users on said list can edit said object and transmit the resulting edited object to said one or more trusted servers with instructions to transmit said edited object to the members of said list as well as to the user who originally distributed said object; and wherein said edited object is then transmitted from said trusted servers to the members of said list as well as to the user who originally distributed said object.
16. A method for banking via a system for a plurality of users to share resources, said method comprising the following steps:
- establishing a network of computing devices used by two or more users wherein each of said users possesses a unique network identifier and wherein each unique identifier can be related to each other unique identifier based on a criterion, wherein said criterion is the degree of separation between one user and another based on a pre-existing relationship of trust, as defined by said users; and
- providing a banking server connected to said network wherein said computing devices can exchange processed data packets with said banking server; wherein said processed data packets contain information relating to communication between said two or more users relating to borrowing or loaning money from one of said two or more users to another of said two or more users; and
- wherein said banking server coordinates and manages the interactions between said users according to pre-set rules.
Type: Application
Filed: May 2, 2006
Publication Date: Nov 16, 2006
Inventors: CHUNG TAM (OTTAWA, ON), PARAMJIT GILL (OTTAWA, ON), BARJINDERPAL GILL (LOS GATOS, CA)
Application Number: 11/381,282
International Classification: H04L 9/32 (20060101);
