ARM4SNS - Revision history

Mstigge at 10:52, 7 May 2006

2006-05-07T10:52:32Z

← Older revision		Revision as of 10:52, 7 May 2006
Line 1:		Line 1:
	[[Category:ARM4SNS]]		[[Category:ARM4SNS]]
	* [[ARM4SNS Web Ressources]]		* [[ARM4SNS Web Ressources]]
			* [[Anonymization_Layer-Reputation_System_protocol]]


	=Introduction=		=Introduction=

Wolfm: /* State of the art */

2006-03-28T11:40:53Z

State of the art

← Older revision		Revision as of 11:40, 28 March 2006
Line 73:		Line 73:
	** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])		** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])
	*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.		*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.
	** '''TrustRank''', [http://dbpubs.stanford.edu:8090/pub/showDoc.Fulltext?lang=en&doc=2004-17&format=pdf&compression=&name=2004-17.pdf]		** '''TrustRank''', [http://dbpubs.stanford.edu:8090/pub/showDoc.Fulltext?lang=en&doc=2004-17&format=pdf&compression=&name=2004-17.pdf PDF]
			*** PageRank first select a small set of seed pages has to be evaluated by hand. Once manually the reputable seed pages are identified, the link structure of the web is used to discover other pages that are likely to be good. The authors show that they can effectively filter out spam from a significant fraction of the web, based on a good seed set of less than 200 sites.
	** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])		** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])
	*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures. (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]])		*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures. (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]])

Wolfm: /* State of the art */

2006-03-24T13:34:03Z

State of the art

← Older revision		Revision as of 13:34, 24 March 2006
Line 72:		Line 72:
	** '''TrustNet''' (2000), Schillo, Funk et al. (found at [http://citeseer.ist.psu.edu/schillo00using.html Citeseer])		** '''TrustNet''' (2000), Schillo, Funk et al. (found at [http://citeseer.ist.psu.edu/schillo00using.html Citeseer])
	** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])		** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])
⚫	** '''TrustRank''', [http://dbpubs.stanford.edu:8090/pub/showDoc.Fulltext?lang=en&doc=2004-17&format=pdf&compression=&name=2004-17.pdf]
	*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.		*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.
		⚫	** '''TrustRank''', [http://dbpubs.stanford.edu:8090/pub/showDoc.Fulltext?lang=en&doc=2004-17&format=pdf&compression=&name=2004-17.pdf]
	** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])		** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])
	*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures. (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]])		*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures. (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]])

Wolfm: /* State of the art */

2006-03-24T13:32:12Z

State of the art

← Older revision		Revision as of 13:32, 24 March 2006
Line 72:		Line 72:
	** '''TrustNet''' (2000), Schillo, Funk et al. (found at [http://citeseer.ist.psu.edu/schillo00using.html Citeseer])		** '''TrustNet''' (2000), Schillo, Funk et al. (found at [http://citeseer.ist.psu.edu/schillo00using.html Citeseer])
	** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])		** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])
			** '''TrustRank''', [http://dbpubs.stanford.edu:8090/pub/showDoc.Fulltext?lang=en&doc=2004-17&format=pdf&compression=&name=2004-17.pdf]
	*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.		*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.
	** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])		** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])

Dato: /* State of the art */

2006-02-27T19:11:59Z

State of the art

← Older revision		Revision as of 19:11, 27 February 2006
Line 59:		Line 59:
	*Literature survey		*Literature survey
	** The '''Beta''' Reputation System (2002), Audun Jøsang, Roslan Ismail, In Proceedings of the 15th Bled Electronic Commerce Conference, Bled, Slovenia, June 2002 ([http://security.dstc.edu.au/papers/JI2002-Bled.pdf PDF])		** The '''Beta''' Reputation System (2002), Audun Jøsang, Roslan Ismail, In Proceedings of the 15th Bled Electronic Commerce Conference, Bled, Slovenia, June 2002 ([http://security.dstc.edu.au/papers/JI2002-Bled.pdf PDF])
	*** Posteriori probabilities of binary events can be represented as beta distributions. Combining feedback resulting from an e-commerce transaction is not the same as statistical observation of a binary event, because an agent's perceived satisfaction after a transaction is not binary. Instead positive and negative feedback is given as a pair (r,s) of '''continuous''' values where r reflects the degree of satisfaction and s reflects the degree of dissatisfaction. Discounting (highly reputed agents carry more weight when they give feedback) and forgetting (old feedback may not be relevant) of the reputation values are also used.		*** Posteriori probabilities of binary events can be represented as beta distributions. Combining feedback resulting from an e-commerce transaction is not the same as statistical observation of a binary event, because an agent's perceived satisfaction after a transaction is not binary. Instead positive and negative feedback is given as a pair (r,s) of '''continuous''' values where r reflects the degree of satisfaction and s reflects the degree of dissatisfaction. Discounting (highly reputed agents carry more weight when they give feedback) and forgetting (old feedback may not be relevant) of the reputation values are also used.(see [[ARM4SNS:ReputationFunctions#Beta\|Beta]])
	** '''Trustdavis''' (2005), DeFigueiredo, Barr, ([http://www.cs.ucdavis.edu/~defigued/trustdavis.pdf PDF])		** '''Trustdavis''' (2005), DeFigueiredo, Barr, ([http://www.cs.ucdavis.edu/~defigued/trustdavis.pdf PDF])
	***Newcomers have to pay a deposit for references. The deposit is used to save transactions. Pseudonyms are more expensive.		***Newcomers have to pay a deposit for references. The deposit is used to save transactions. Pseudonyms are more expensive.

Dato: /* State of the art */

2006-02-27T18:47:23Z

State of the art

← Older revision		Revision as of 18:47, 27 February 2006
Line 74:		Line 74:
	*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.		*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.
	** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])		** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])
	*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures.		*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures. (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]])
	*Conferences to watch		*Conferences to watch
	*Companies active in this area		*Companies active in this area
	**''Open Ratings'' http://www.openratings.com/		**''Open Ratings'' http://www.openratings.com/
	*Examples (to move in a restricted area?)
	**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]]) <br>

Dato: /* State of the art */

2006-02-27T18:43:58Z

State of the art

← Older revision		Revision as of 18:43, 27 February 2006
Line 80:		Line 80:
	*Examples (to move in a restricted area?)		*Examples (to move in a restricted area?)
	**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]]) <br>		**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]]) <br>
	***<math>P</math>: set of hyperlinked webpages<br>
	***<math>u,v</math>: webpages in P<br>
	***<math>N^{-}(u)</math>: set of webpages pointing to u<br>
	***<math>N^{+}(v)</math>: set of webpages that v points to<br>
	***the PageRank is: <math> R(u) = cE(u) + c \sum_{v\in N^{-}(u)} {R(v)\over{\|N^{+}(v)\|}}</math> (1.)
	***<math>c</math> is chosen such that <math> \sum_{u \in P} R(u) = 1</math><br>
	***<math>E</math> is a vector over <math>P</math> corresponding to a source of rank and is chosen such that <math> \sum_{u \in P} E(u) = 0.15</math><br>
	***first term of function (1.) <math> cE(u) </math> gives rank value based on initial rank <br>
	***second term of (1.) <math>c\sum_{v\in N^{-}(u)} {R(v)\over{\|N^{+}(v)\|}}</math> gives rank value as a function of hyperlinks pointing at <math> u </math><br>

Dato: /* State of the art */

2006-02-27T18:42:29Z

State of the art

← Older revision		Revision as of 18:42, 27 February 2006
Line 79:		Line 79:
	**''Open Ratings'' http://www.openratings.com/		**''Open Ratings'' http://www.openratings.com/
	*Examples (to move in a restricted area?)		*Examples (to move in a restricted area?)
	**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) <br>		**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) (see [[ARM4SNS:ReputationFunctions#PageRank\|PageRank]]) <br>
	***<math>P</math>: set of hyperlinked webpages<br>		***<math>P</math>: set of hyperlinked webpages<br>
	***<math>u,v</math>: webpages in P<br>		***<math>u,v</math>: webpages in P<br>

Dato: /* State of the art */

2006-02-12T15:10:36Z

State of the art

← Older revision		Revision as of 15:10, 12 February 2006
Line 73:		Line 73:
	** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])		** '''TrustMe''', Singh, Liu, (found at [http://citeseer.ist.psu.edu/675810.html Citeseer])
	*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.		*** Secure and anonymous protocol for Trustmanagement. Uses public key cryptography mechanisms. Each peer has a couple of public-private key pairs. Trust value of a peer (A) is randomly assigned to another peer (Trust holding agent=THA) at bootstrapping. The trust holding responsibilities are equally distributed amongst the peers and are unknown to all peers including peer (A). A peer (B) broadcasts a trust query for peer (A), the THA replies with the trust value.
			** '''A Survey of Trust and Reputation Systems for Online Service Provision''', (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF])
			*** They provide some details for eBay, AllExperts, Advogato, Epinions, BizRate, Amazon, Slashdot, Kuro5in, PageRank and they describe various principles for computing reputation and trust measures.
	*Conferences to watch		*Conferences to watch
	*Companies active in this area		*Companies active in this area
			**''Open Ratings'' http://www.openratings.com/
	*Examples (to move in a restricted area?)		*Examples (to move in a restricted area?)
	**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) <br>		**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) <br>
Line 81:		Line 84:
	***<math>N^{-}(u)</math>: set of webpages pointing to u<br>		***<math>N^{-}(u)</math>: set of webpages pointing to u<br>
	***<math>N^{+}(v)</math>: set of webpages that v points to<br>		***<math>N^{+}(v)</math>: set of webpages that v points to<br>
			***the PageRank is: <math> R(u) = cE(u) + c \sum_{v\in N^{-}(u)} {R(v)\over{\|N^{+}(v)\|}}</math> (1.)
	***<math>E</math> vector over <math>P</math> corresponding to a source of rank<br>
	***<math>c</math> is chosen such that <math> \sum_{u \in P} R(u) = 1</math><br>		***<math>c</math> is chosen such that <math> \sum_{u \in P} R(u) = 1</math><br>
	***~~the PageRank~~ is: <math> ~~R(u)~~ = ~~cE(u)~~ + c \sum_{v\in ~~N^{-~~}(u)} ~~{R(v)\over{\|N^{+}(v)\|}}~~</math><br>		***<math>E</math> is a vector over <math>P</math> corresponding to a source of rank and is chosen such that <math> \sum_{u \in P} E(u) = 0.15</math><br>
	***~~<math>~~ E ~~</math>~~ is ~~chosen~~ ~~such that~~ <math> ~~\sum_{u \in P} E~~(u) ~~= 0.15~~</math><br>		***first term of function (1.) <math> cE(u) </math> gives rank value based on initial rank <br>
	***~~first~~ term <math> cE(u) </math> gives rank value ~~based~~ on ~~initial~~ ~~rank~~ <br>		***second term of (1.) <math>c\sum_{v\in N^{-}(u)} {R(v)\over{\|N^{+}(v)\|}}</math> gives rank value as a function of hyperlinks pointing at <math> u </math><br>
	***second term <math>c \sum_{v\in N^{-}(u)} {R(v)\over{\|N^{+}(v)\|}}</math> gives rank value as a function of hyperlinks pointing at <math> u </math><br>

Dato: /* State of the art */

2006-02-12T14:46:20Z

State of the art

← Older revision		Revision as of 14:46, 12 February 2006
Line 76:		Line 76:
	*Companies active in this area		*Companies active in this area
	*Examples (to move in a restricted area?)		*Examples (to move in a restricted area?)
			**'''PageRank''' taken from "A Survey of Trust and Reputation Systems for Online Service Provision", (2005), Jøsang et al. ([http://security.dstc.edu.au/papers/JIB2005-DSS.pdf PDF]) <br>
	**'''PageRank'''<br>
	***<math>P</math>: set of hyperlinked webpages<br>		***<math>P</math>: set of hyperlinked webpages<br>
	***<math>u,v</math>: webpages in P<br>		***<math>u,v</math>: webpages in P<br>