Blind Signatures.pptVIP

Blind Signatures盲簽章 Chun-I Fan 范俊逸 E-Commerce Security Engineering Lab. Department of Computer Science and Engineering National Sun Yat-Sen University cifan@cse.nsysu.edu.tw Outlines Introduction Digital Signatures Blind Signatures Partially Blind Signatures Fair Blind Signatures A User Efficient Blind Signature Scheme Conclusions Introduction Features of Internet Services Efficiency: Faster than traditional services Ubiquity: Users can obtain services anywhere Flexibility: Clients can request services anytime Openness: Popularization Examples: Electronic cash and voting services Some Challenges to Internet Services Security Hackers and viruses Privacy and policy considerations Efficiency A lot of extra computations must be performed by users Limited power of devices such as mobile units or smart cards Digital Signatures A Digital Signature Scheme Blind Signatures Blind Signatures The Scheme A Generic Blind Signature Scheme M : the underlying set of messages R : a finite set of random integers S : M? MT : signing V : MT ? M ? {true, false} : verifying B : M ? R ? M : blinding U : MT ? R ? MT : unblinding The Protocol An Anonymous Voting Protocol An Untraceable E-Cash Protocol Partially Blind Signatures Fair Blind Signatures A User Efficient Blind Signature Scheme The Underlying Foundation Based on Quadratic Residues If x2 = y (mod n), then y is a quadratic residue (QR) in Zn and x is a square root of y If n = p1p2 where p1 and p2 are two distinct large primes, then, given (y, n), it is intractable to compute x without p1 or p2. The Blind Signature Protocol The Blinding Stage The Randomizing Stage The Signing Stage The Unblinding Stage The Blinding Stage The Randomizing Stage The Signing Stage The Unblinding Stage Features Unlinkability: (b,u,v) is randomly chosen and kept secret by the user Unforgeability: (p1,p2) is kept secret by the signer and H is one-way User Efficiency: 10 multiplications and 1 hashing for getting a signature; 4 multiplications and 1 h