Pairing-based identification schemes

Simple item page
dc.creatorFreeman, David
dc.date2005-09-19
dc.date.accessioned2026-07-07T06:18:02Z
dc.date.available2026-07-07T06:18:02Z
dc.descriptionWe propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme.
dc.identifierhttps://arxiv.org/abs/cs/0509056
dc.identifierhttp://arxiv.org/abs/cs/0509056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94602
dc.subjectCryptography and Security
dc.subjectE.3
dc.titlePairing-based identification schemes
dc.typetext

Files

Collections

arXiv