1 / 1

interaction

:(3,2,1). :(3,2,2). :(3,2,0). Imai Laboratory Introduction - Cryptography. fingerprint for registration. Arrange { } on that plane so that …. There are 8 { }s in total. There are about ( 2 , 1 , 1 ) { }s in , respectively. There are about ( 2 , 2 , 0 )

rivka
Download Presentation

interaction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. :(3,2,1) :(3,2,2) :(3,2,0) Imai Laboratory Introduction - Cryptography fingerprint for registration Arrange { } on that plane so that … • There are 8 { }s in total. • There are about(2, 1, 1) { }s in , respectively. • There are about(2, 2, 0) { }s in , respectively. • There are about(2, 1, 1) { }s in , respectively. Zero-knowledgeInteractive Proof System[GMR85] • is a special type of interactive proof, wherethe verifier cannot obtain any knowledge about the prover’s secret information. fingerprint for authentication (Standard) authentication[FS87] • enables the users to be authenticated without sending their passwords. Claim that he/she knows some secret information interaction Verify the validity of the prover’s claim Verifier Prover Biometrics allows ambiguity Fingerprint authentication • uses fingerprint instead of passwords or ID-cards. • convenient • dangerous when the secret information is stolen Overcome this gap by novel methodology [K07] Novel NP-complete problem registration as a geometrical arrangement problem specialized for minutiae method, which is the most popular matching algorithm for fingerprint authentication conversion similar fingerprints are transformed to the similarproblems. • D-MA instance • x D-MA = D-Minutiae Arrangement Problem possible? R2 authentication possible! allows an error interaction claim that he/she knows the answer of x (≒the fingerprint for registration) Verifier Prover or Zero-knowledge Interactive Proof or There are 2 s and 2 s (in this case, exactly). [GMR85] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal of Computing. [FS87] A. Fiat and A. Shamir, “How to prove yourself: practical solutions to identification and signature problems” (Crypto ’86) [K07] K.Kojima, “Zero-Knowledge Proofs Considering Error for Secure Fingerprint Authentication” (IPSJ ‘07)

More Related