TY - JOUR
T1 - Multifactor identity verification using aggregated proof of knowledge
AU - Bhargav-Spantzel, Abhilasha
AU - Squicciarini, Anna Cinzia
AU - Xue, Rui
AU - Bertino, Elisa
N1 - Funding Information:
Manuscript received May 25, 2009; revised November 4, 2009 and January 23, 2010; accepted February 7, 2010. Date of publication April 15, 2010; date of current version June 16, 2010. The work of R. Xue was supported in part by the Fund of the China Scholarship Council, in part by the National Natural Science Foundation of China under Grant 60873260 and Grant 60903210, in part by the 863 Program under Grant 2009AA01Z414, and in part by the 973 Program under Grant 2007CB311202. This paper was recommended by Associate Editor E. R. Weippl.
PY - 2010/7
Y1 - 2010/7
N2 - The problem of identity theft, that is, the act of impersonating others identities by presenting stolen identifiers or proofs of identities, has been receiving increasing attention because of its high financial and social costs. In this paper, we address the problem of verification of such identifiers and proofs of identity. Our approach is based on the concept of privacy preserving multifactor verification of such identifiers and proofs achieved by the development of a new cryptographic primitive, which uses aggregate signatures on commitments that are then used for aggregate zero-knowledge proof of knowledge (ZKPK) protocols. The resultant signatures are very short and the ZKPs are succinct and efficient. We prove the security of our scheme under the co-gap DiffieHellman (co-GDH) assumption for groups with bilinear maps. Our cryptographic scheme is an improvement in terms of the performance, flexibility, and storage requirements than the existing efficient ZKPK techniques that may be used to prove under zero knowledge and the knowledge of multiple secrets.
AB - The problem of identity theft, that is, the act of impersonating others identities by presenting stolen identifiers or proofs of identities, has been receiving increasing attention because of its high financial and social costs. In this paper, we address the problem of verification of such identifiers and proofs of identity. Our approach is based on the concept of privacy preserving multifactor verification of such identifiers and proofs achieved by the development of a new cryptographic primitive, which uses aggregate signatures on commitments that are then used for aggregate zero-knowledge proof of knowledge (ZKPK) protocols. The resultant signatures are very short and the ZKPs are succinct and efficient. We prove the security of our scheme under the co-gap DiffieHellman (co-GDH) assumption for groups with bilinear maps. Our cryptographic scheme is an improvement in terms of the performance, flexibility, and storage requirements than the existing efficient ZKPK techniques that may be used to prove under zero knowledge and the knowledge of multiple secrets.
UR - http://www.scopus.com/inward/record.url?scp=77953719966&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953719966&partnerID=8YFLogxK
U2 - 10.1109/TSMCC.2010.2045755
DO - 10.1109/TSMCC.2010.2045755
M3 - Article
AN - SCOPUS:77953719966
SN - 1094-6977
VL - 40
SP - 372
EP - 383
JO - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
JF - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
IS - 4
M1 - 5447665
ER -