close
【2010.07.06】 Communication,
Trust Management, and Social Informatics
subtitle: How can we communicate effectively and have fun over Facebook?
subtitle: How can we communicate effectively and have fun over Facebook?
Felix Wu ucdavis
我們要提出的是，不是每個人連上網路就能連上每個人。
而是經過social networks才能連出去。
Communication paradigms
*unique identifier
-email voIP
http/url TCP/IP L3( or L7(
*communication
of Interests
-wikipedia search
engine(描述誰對 bit torrent
*communication
of social interests
-facebook farmville
我們是否lost 了 unique identifier ?
at least,
phishing attacks
IN DSL,ANYBODY
can claim to BoA as long as they announce the magic keywords.
-so we are 'phishing by default'
Social control Layer
IP
layer -> BGP layer
現在就是你的end user無法提供足夠的資料。
每個object
提供多個 用途
app tests
ex1 credential -oriented
pki-certificate
ex2
service -oriented sercice protocol bandwidth
ex3
offer-oriented -coupons /promotions
幫助我們去找一條路
how
to build the trust
fighter's club
fb的關係只有0跟1而已
從
裏面來看10%的人有90%的朋友都是base on 這個遊戲
而我們要設計的social imformatis
是要一個真實的關係
facebook roughly your friends (or firend2s )
Quality
of the friendship may have been out of control
很多人只是來facebook收
集情報
Three Trust Values structure
Ainit Afwd 兩者分開
reputation
system
用小額的交易 讓自己的信任值變高 一下賣貴的東西把錢賺回來
beholder
definition
3.13 non-exploitable reputation function
De nition 3.13
(non-exploitability). A non-exploitable reputation function is
a
reputation function where: For any given world W, for any vertex vi and
any
trust threshold h chosen by that vertex, no untrusted
collusion inW can change
the trust value of any agent vj ,
i.e.f(vi; vj ). This is done by comparing trust
values in two
worlds: the standard honest world W and any world manipulated
by
an untrusted collusion.
http://www.cs.ucdavis.edu/~defigued/整
個系統還有一些嚴重的缺點
Routing with Trust
simulation
study
betweenness 中間人
系統的design 把中間人 的傷害降到最低
因為中間的node會送出不好的
所以本來可以經過他變成不經過他
線的粗細 表使用量
1000
nodes 20% bad
最大的好處，95%的friendship 被收發端開始處罰
把不是非常好的
從我的social network砍掉
"人" 任意時間之內 我的朋友的數字 能夠維持多少的關係
150
Problems
with this simple approach
m+1
_______
m+n+2
過
去十年都是好行為 m好10000 n10不好
1.不敏銳了？！
2.一個node recover
的機率很低
所以要有點複雜的function
Pairwise 1-way trust
trust
dynamic
全站熱搜
留言列表
