Generally, the goal of identification schemes is to provide security assurance against impersonation attacks. Identification schemes based on zero knowledge protocols have more advantages, for example, deniability, which enables the prover to deny an identification proof so that the verifier couldn't persuade others that it is indeed the prover who identified itself to him. However, in some applications we require the existence of a (trusted) party being able to find out an evidence that a party did identify itself to a verifier is required, in order to prevent parties from misbehavior. So in this case 'undeniability' is needed. To the best of our knowledge, an identification scheme that provides both deniability and undeniability does not exist in the literature. In this work we propose the notion of escrowed deniable identification schemes, which integrates both 'escrowed deniability' (undeniability) and 'deniability' properties.
|Title of host publication||Security Technology|
|Subtitle of host publication||International Conference, SecTech 2009, Held as Part of the Future Generation Information Technology Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Proceedings|
|Number of pages||8|
|Publication status||Published - 1 Dec 2009|
|Name||Communications in Computer and Information Science|