Efficient Verifiable Computation of XOR for Biometric Authentication

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: L773:1611 3349 OR L773:0302 9743 OR L773:9783540433538 > (2015-2019) > Efficient Verifiabl...

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		03199naa a2200385 4500
001		oai:research.chalmers.se:333cf407-8bc8-4c7e-b00c-3246ae846a4f
003		SwePub
008		171007s2016 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://research.chalmers.se/publication/2455472 URI
024	7	a https://doi.org/10.1007/978-3-319-48965-0_172 DOI
040		a (SwePub)cth
041		a engb eng
042		9 SwePub
072	7	a kon2 swepub-publicationtype
072	7	a ref2 swepub-contenttype
100	1	a Abidin, Aysajan,d 1983u Katholieke Universiteit Leuven4 aut0 (Swepub:cth)aishajia
245	1 0	a Efficient Verifiable Computation of XOR for Biometric Authentication
264		c 2016-10-28
264	1	a Cham :b Springer International Publishing,c 2016
520		a This work addresses the security and privacy issues in remote biometric authentication by proposing an efficient mechanism to verify the correctness of the outsourced computation in such protocols. In particular, we propose an efficient verifiable computation of XORing encrypted messages using an XOR linear message authentication code (MAC) and we employ the proposed scheme to build a biometric authentication protocol. The proposed authentication protocol is both secure and privacy-preserving against malicious (as opposed to honest-but-curious) adversaries. Specifically, the use of the verifiable computation scheme together with an homomorphic encryption protects the privacy of biometric templates against malicious adversaries. Furthermore, in order to achieve unlinkability of authentication attempts, while keeping a low communication overhead, we show how to apply Oblivious RAM and biohashing to our protocol. We also provide a proof of security for the proposed solution. Our simulation results show that the proposed authentication protocol is efficient.
650	7	a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Annan elektroteknik och elektronik0 (SwePub)202992 hsv//swe
650	7	a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Other Electrical Engineering, Electronic Engineering, Information Engineering0 (SwePub)202992 hsv//eng
653		a Template privacy and security
653		a Universal hash functions
653		a Homomorphic encryption
653		a Verifiable computation
653		a Biometric authentication
700	1	a Aly, Abdelrahamanu Katholieke Universiteit Leuven4 aut
700	1	a Rua, Enrique Argonesu Katholieke Universiteit Leuven4 aut
700	1	a Mitrokotsa, Aikaterini,d 1978u Chalmers tekniska högskola,Chalmers University of Technology4 aut0 (Swepub:cth)aikmitr
710	2	a Katholieke Universiteit Leuvenb Chalmers tekniska högskola4 org
773	0	t Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)d Cham : Springer International Publishingg 10052, s. 284-298q 10052<284-298x 1611-3349x 0302-9743
856	4	u https://www.cosic.esat.kuleuven.be/publications/article-2712.pdf
856	4 8	u https://research.chalmers.se/publication/245547
856	4 8	u https://doi.org/10.1007/978-3-319-48965-0_17

Hitta via bibliotek

Lecture Notes in Computer Science (including subseries Lecture Notes in Artifici... (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Abidin, Aysajan, ...; Aly, Abdelrahama ...; Rua, Enrique Arg ...; Mitrokotsa, Aika ...

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Annan elektrotek ...

Artiklar i publikationen: Lecture Notes in ...

Av lärosätet: Chalmers tekniska högskola

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se