DL-Extractable UC-Commitment Schemes

Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Janno Siim; Michał Zajac

doi:10.1007/978-3-030-21568-2_19

DL-Extractable UC-Commitment Schemes

Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michał Zajac

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

Abstract / Description of output

We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element g^x; however, the simulator will be able to extract its discrete logarithm x. Such functionality is useful in situations where the secrecy of x is important since the knowledge of x enables to break privacy while the simulator needs to know x to be able to simulate the corrupted committer. Based on Fujisaki's UC-secure commitment scheme and the Damgård-Fujisaki integer commitment scheme, we propose an efficient commitment scheme that realizes the new functionality. As another novelty, we construct the new scheme in the weaker RPK (registered public key) model instead of the CRS model used by Fujisaki.

Original language	English
Title of host publication	Applied Cryptography and Network Security
Editors	Robert H. Deng, Valérie Gauthier-Umaña, Martín Ochoa, Moti Yung
Place of Publication	Cham
Publisher	Springer
Pages	385-405
Number of pages	21
ISBN (Electronic)	978-3-030-21568-2
ISBN (Print)	978-3-030-21567-5
DOIs	https://doi.org/10.1007/978-3-030-21568-2_19
Publication status	Published - 29 May 2019
Event	17th International Conference on Applied Cryptography and Network Security - Bogotá, Colombia Duration: 5 Jun 2019 → 7 Jun 2019 https://www.acns19.com/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer, Cham
Volume	11464
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th International Conference on Applied Cryptography and Network Security
Abbreviated title	ACNS 2019
Country/Territory	Colombia
City	Bogotá
Period	5/06/19 → 7/06/19
Internet address	https://www.acns19.com/

Access to Document

10.1007/978-3-030-21568-2_19Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007%2F978-3-030-21568-2_19Licence: All Rights Reserved

PRIViLEDGE: Privacy in Distributed Ledgers
Kiayias, A.
EU government bodies
1/01/18 → 30/06/21
Project: Research

Cite this

@inproceedings{4de17f55ad3c40ee9193068d85c27663,

title = "DL-Extractable UC-Commitment Schemes",

abstract = "We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element g^x; however, the simulator will be able to extract its discrete logarithm x. Such functionality is useful in situations where the secrecy of x is important since the knowledge of x enables to break privacy while the simulator needs to know x to be able to simulate the corrupted committer. Based on Fujisaki's UC-secure commitment scheme and the Damg{\aa}rd-Fujisaki integer commitment scheme, we propose an efficient commitment scheme that realizes the new functionality. As another novelty, we construct the new scheme in the weaker RPK (registered public key) model instead of the CRS model used by Fujisaki.",

author = "Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Micha{\l} Zajac",

year = "2019",

month = may,

day = "29",

doi = "10.1007/978-3-030-21568-2_19",

language = "English",

isbn = "978-3-030-21567-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "385--405",

editor = "Deng, {Robert H.} and Val{\'e}rie Gauthier-Uma{\~n}a and Mart{\'i}n Ochoa and Moti Yung",

booktitle = "Applied Cryptography and Network Security",

note = "17th International Conference on Applied Cryptography and Network Security, ACNS 2019 ; Conference date: 05-06-2019 Through 07-06-2019",

url = "https://www.acns19.com/",

}

Abdolmaleki, B, Baghery, K, Lipmaa, H, Siim, J & Zajac, M 2019, DL-Extractable UC-Commitment Schemes. in RH Deng, V Gauthier-Umaña, M Ochoa & M Yung (eds), Applied Cryptography and Network Security. Lecture Notes in Computer Science, vol. 11464, Springer, Cham, pp. 385-405, 17th International Conference on Applied Cryptography and Network Security, Bogotá, Colombia, 5/06/19. https://doi.org/10.1007/978-3-030-21568-2_19

DL-Extractable UC-Commitment Schemes. / Abdolmaleki, Behzad; Baghery, Karim; Lipmaa, Helger et al.
Applied Cryptography and Network Security. ed. / Robert H. Deng; Valérie Gauthier-Umaña; Martín Ochoa; Moti Yung. Cham: Springer, 2019. p. 385-405 (Lecture Notes in Computer Science; Vol. 11464).

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

TY - GEN

T1 - DL-Extractable UC-Commitment Schemes

AU - Abdolmaleki, Behzad

AU - Baghery, Karim

AU - Lipmaa, Helger

AU - Siim, Janno

AU - Zajac, Michał

PY - 2019/5/29

Y1 - 2019/5/29

N2 - We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element g^x; however, the simulator will be able to extract its discrete logarithm x. Such functionality is useful in situations where the secrecy of x is important since the knowledge of x enables to break privacy while the simulator needs to know x to be able to simulate the corrupted committer. Based on Fujisaki's UC-secure commitment scheme and the Damgård-Fujisaki integer commitment scheme, we propose an efficient commitment scheme that realizes the new functionality. As another novelty, we construct the new scheme in the weaker RPK (registered public key) model instead of the CRS model used by Fujisaki.

AB - We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element g^x; however, the simulator will be able to extract its discrete logarithm x. Such functionality is useful in situations where the secrecy of x is important since the knowledge of x enables to break privacy while the simulator needs to know x to be able to simulate the corrupted committer. Based on Fujisaki's UC-secure commitment scheme and the Damgård-Fujisaki integer commitment scheme, we propose an efficient commitment scheme that realizes the new functionality. As another novelty, we construct the new scheme in the weaker RPK (registered public key) model instead of the CRS model used by Fujisaki.

U2 - 10.1007/978-3-030-21568-2_19

DO - 10.1007/978-3-030-21568-2_19

M3 - Conference contribution

SN - 978-3-030-21567-5

T3 - Lecture Notes in Computer Science

SP - 385

EP - 405

BT - Applied Cryptography and Network Security

A2 - Deng, Robert H.

A2 - Gauthier-Umaña, Valérie

A2 - Ochoa, Martín

A2 - Yung, Moti

PB - Springer

CY - Cham

T2 - 17th International Conference on Applied Cryptography and Network Security

Y2 - 5 June 2019 through 7 June 2019

ER -

DL-Extractable UC-Commitment Schemes

Abstract / Description of output

Publication series

Conference

Access to Document

Fingerprint

Projects

PRIViLEDGE: Privacy in Distributed Ledgers

Cite this