fair blind signature based authentication for super peer p2p network authors: xiaoliang wang and...

Post on 08-Jan-2018

222 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

DESCRIPTION

INTRODUCTION 3 Two types of DRM mechanism FBST (Fair Blind Signature Trust)

TRANSCRIPT

Fair Blind Signature Based Authentication for Super Peer P2P Network

Authors: Xiaoliang Wang and Xingming SunSource: 2009, Information Technology Journal, vol. 8, issue. 6, pp. 887-894Speaker: Yi-Ru LinDate: 09/17/2010

1

National Chung Hsing University

Outline

IntroductionRelated workProposed schemeSecurity analysisComment

2

INTRODUCTION

3

Two types of DRM mechanismFBST (Fair Blind Signature Trust)

Protect mechanismTrace mechanism

Two types of DRM mechanism

4

Identity authenticityTraceabilityPrivacy protectionResilience to a large number of peer

FBST (Fair Blind Signature Trust)

5

RELATED WORKS

6

Fair blind signatureShamir secret sharing

7

Related work – Fair blind signatureSender, Signer, Trusted entity

Sender

TrustedEntity

SignerBlind Signature

Message- signature pair Signature record

Trace

Trace

8

Proposed Scheme(1/5)

Shamir’s threshold scheme

PT: prime number PT a≧ 0

t : degree of polynomial a0 : group key

Example:t=3 ; a0=1234 ; n = 6

g(x) = 94x2+166x+1234

(1,1494);(2,1942);(3,2578);(4,3402);(5,4414);(6,5614)

g(x)

= 94x2+166x+1234

g(0) = 1234

9

Content DistributionGaussian elimination (高斯消去法 )

In the block, Music provider generates k(k>t) different UID value and distributes them in the p2p network. (UID, h0(UID))

Example H0(UID)’=a+b(UID)’H0(UID)’’=a+b(UID)’ ‘

2x+y-z=8-3x-y+2z=-11-2x+y+2z=-3

2 1 -1 | 8-3 -1 2 | -11-2 1 2 | -3

2 1 -1 | 8 0 1/2 1/2 | 1 0 0 -1 | 1

1 0 0 | 2 0 1 0 | 3 0 0 1 | -1

Assumption UID’=3, UID’’=2, H0(UID)’=10, and H0(UID)’’=5 10=a+3b 5=a+2b a=-5, b=5 => H0(UID)= -5+5(UID)

10

Related work – Shamir secret sharing

PROPOSED SCHEME

11

InitializationLocal signatureThreshold pair sharingAnonymous and authentication communicationTrace malicious peer

12

Initialization

RP

u

SP

Choose: n=pqRSA-like keys:Public: ePrivate: de·d= 1(mod(p-1) ·(q-1))Secure hash function h(·)Publish:(e, n), h(·)

Choose:SRP(·)

Choose:Su(·)

hu(·)

……………

hx(·)………..

ID Hash function

u hu(·)

13

Local signature

RP

u

SP

14

Threshold pair sharing

RP

u

SP

15

Anonymous and authentication communication

RP

u

SP

16

Trace malicious peer

RP

u

SP

SECURITY ANALYSIS

17

Fundamental security objectivesImpersonateTamperPeer compromiseAnonymityTraceability

18

Comments

19

Thanks for your listening

top related