Effiicient ID-based designated verifier signature

Olivier Blazy; Emmanuel Conchon; Paul Germouty; Amandine Jambert

doi:10.1145/3098954.3103157

Effiicient ID-based designated verifier signature

Olivier Blazy
, Emmanuel Conchon
, Paul Germouty
, Amandine Jambert

Limoges University
Commission Nationale de l'Informatique et des Libertés

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The concept of undeniable signatures has been introduced at Crypto'89 by Chaum and van Antwerpen. It has been revisited several times since, in particular by Jakobsson, Sako and Impagliazzo at Eurocrypt' 96 who introduced designated verifier signatures and by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt'03 who designed universal designated verifier signatures. Behind all those notions lies the idea to produce some kind of signature that can be verified only by a targeted verifier. However the verifier should not be able to convince anyone that the signature is valid. In this paper, we present an efficient way to solve those three problems, under classical assumptions, namely DLin and CDH in the standard model. Once we propose such construction, we generalize our approach to a framework showing how to build efficient ID-based Designated Verifier Signature, in the standard model under classical assumptions.

Original language	English
Title of host publication	ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security
Publisher	Association for Computing Machinery
ISBN (Electronic)	9781450352574
DOIs	https://doi.org/10.1145/3098954.3103157
Publication status	Published - 29 Aug 2017
Externally published	Yes
Event	12th International Conference on Availability, Reliability and Security, ARES 2017 - Reggio Calabria, Italy Duration: 29 Aug 2017 → 1 Sept 2017

Publication series

Name	ACM International Conference Proceeding Series
Volume	Part F130521

Conference

Conference	12th International Conference on Availability, Reliability and Security, ARES 2017
Country/Territory	Italy
City	Reggio Calabria
Period	29/08/17 → 1/09/17

Keywords

Identity-based cryptography
Universal designated verifier signatures

Access to Document

10.1145/3098954.3103157

Cite this

Blazy, O., Conchon, E., Germouty, P., & Jambert, A. (2017). Effiicient ID-based designated verifier signature. In ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security Article a44 (ACM International Conference Proceeding Series; Vol. Part F130521). Association for Computing Machinery. https://doi.org/10.1145/3098954.3103157

@inproceedings{da7ca99babc74e1e994f9dfdf895a74e,

title = "Effiicient ID-based designated verifier signature",

abstract = "The concept of undeniable signatures has been introduced at Crypto'89 by Chaum and van Antwerpen. It has been revisited several times since, in particular by Jakobsson, Sako and Impagliazzo at Eurocrypt' 96 who introduced designated verifier signatures and by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt'03 who designed universal designated verifier signatures. Behind all those notions lies the idea to produce some kind of signature that can be verified only by a targeted verifier. However the verifier should not be able to convince anyone that the signature is valid. In this paper, we present an efficient way to solve those three problems, under classical assumptions, namely DLin and CDH in the standard model. Once we propose such construction, we generalize our approach to a framework showing how to build efficient ID-based Designated Verifier Signature, in the standard model under classical assumptions.",

keywords = "Identity-based cryptography, Universal designated verifier signatures",

author = "Olivier Blazy and Emmanuel Conchon and Paul Germouty and Amandine Jambert",

note = "Publisher Copyright: {\textcopyright} 2017 Association for Computing Machinery.; 12th International Conference on Availability, Reliability and Security, ARES 2017 ; Conference date: 29-08-2017 Through 01-09-2017",

year = "2017",

month = aug,

day = "29",

doi = "10.1145/3098954.3103157",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

booktitle = "ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security",

}

Blazy, O, Conchon, E, Germouty, P & Jambert, A 2017, Effiicient ID-based designated verifier signature. in ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security., a44, ACM International Conference Proceeding Series, vol. Part F130521, Association for Computing Machinery, 12th International Conference on Availability, Reliability and Security, ARES 2017, Reggio Calabria, Italy, 29/08/17. https://doi.org/10.1145/3098954.3103157

Effiicient ID-based designated verifier signature. / Blazy, Olivier; Conchon, Emmanuel; Germouty, Paul et al.
ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security. Association for Computing Machinery, 2017. a44 (ACM International Conference Proceeding Series; Vol. Part F130521).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Effiicient ID-based designated verifier signature

AU - Blazy, Olivier

AU - Conchon, Emmanuel

AU - Germouty, Paul

AU - Jambert, Amandine

PY - 2017/8/29

Y1 - 2017/8/29

N2 - The concept of undeniable signatures has been introduced at Crypto'89 by Chaum and van Antwerpen. It has been revisited several times since, in particular by Jakobsson, Sako and Impagliazzo at Eurocrypt' 96 who introduced designated verifier signatures and by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt'03 who designed universal designated verifier signatures. Behind all those notions lies the idea to produce some kind of signature that can be verified only by a targeted verifier. However the verifier should not be able to convince anyone that the signature is valid. In this paper, we present an efficient way to solve those three problems, under classical assumptions, namely DLin and CDH in the standard model. Once we propose such construction, we generalize our approach to a framework showing how to build efficient ID-based Designated Verifier Signature, in the standard model under classical assumptions.

AB - The concept of undeniable signatures has been introduced at Crypto'89 by Chaum and van Antwerpen. It has been revisited several times since, in particular by Jakobsson, Sako and Impagliazzo at Eurocrypt' 96 who introduced designated verifier signatures and by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt'03 who designed universal designated verifier signatures. Behind all those notions lies the idea to produce some kind of signature that can be verified only by a targeted verifier. However the verifier should not be able to convince anyone that the signature is valid. In this paper, we present an efficient way to solve those three problems, under classical assumptions, namely DLin and CDH in the standard model. Once we propose such construction, we generalize our approach to a framework showing how to build efficient ID-based Designated Verifier Signature, in the standard model under classical assumptions.

KW - Identity-based cryptography

KW - Universal designated verifier signatures

UR - https://www.scopus.com/pages/publications/85030329303

U2 - 10.1145/3098954.3103157

DO - 10.1145/3098954.3103157

M3 - Conference contribution

AN - SCOPUS:85030329303

T3 - ACM International Conference Proceeding Series

BT - ARES 2017 - Proceedings of the 12th International Conference on Availability, Reliability and Security

PB - Association for Computing Machinery

T2 - 12th International Conference on Availability, Reliability and Security, ARES 2017

Y2 - 29 August 2017 through 1 September 2017

ER -

Effiicient ID-based designated verifier signature

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this