File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-10847-1_29
- Scopus: eid_2-s2.0-73349106486
- WOS: WOS:000273735800029
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Escrowed deniable identification schemes
Title | Escrowed deniable identification schemes |
---|---|
Authors | |
Issue Date | 2009 |
Citation | Communications in Computer and Information Science, 2009, v. 58, p. 234-241 How to Cite? |
Abstract | 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. © 2009 Springer-Verlag Berlin Heidelberg. |
Persistent Identifier | http://hdl.handle.net/10722/280759 |
ISSN | 2023 SCImago Journal Rankings: 0.203 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Thorncharoensri, Pairat | - |
dc.contributor.author | Huang, Qiong | - |
dc.contributor.author | Susilo, Willy | - |
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Mu, Yi | - |
dc.contributor.author | Wong, Duncan | - |
dc.date.accessioned | 2020-02-17T14:34:52Z | - |
dc.date.available | 2020-02-17T14:34:52Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | Communications in Computer and Information Science, 2009, v. 58, p. 234-241 | - |
dc.identifier.issn | 1865-0929 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280759 | - |
dc.description.abstract | 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. © 2009 Springer-Verlag Berlin Heidelberg. | - |
dc.language | eng | - |
dc.relation.ispartof | Communications in Computer and Information Science | - |
dc.title | Escrowed deniable identification schemes | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-10847-1_29 | - |
dc.identifier.scopus | eid_2-s2.0-73349106486 | - |
dc.identifier.volume | 58 | - |
dc.identifier.spage | 234 | - |
dc.identifier.epage | 241 | - |
dc.identifier.isi | WOS:000273735800029 | - |
dc.identifier.issnl | 1865-0929 | - |