Unique aggregate signatures with applications to distributed verifiable random functions

Veronika Kuchta, Mark Manulis

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

4 Citations (Scopus)

Abstract

The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propose the first generic approach for building DVRFs, under much weaker setup assumptions, where we only require existence of a shared random string. More precisely, we first aim at constructions of Distributed Verifiable Unpredictable Functions (DVUF) that can then be converted to DVRF using inner products with a random string as specified by Micali, Rabin, and Vadhan (FOCS'99) for the non-distributed VUF/VRF case. Our main contribution are generic DVUF constructions from aggregate signatures that satisfy the property of uniqueness.We define uniqueness for two flavors of aggregate signatures (with public and sequential aggregation) and show that both flavors can be used to obtain DVUF. By proving uniqueness of existing pairing-based aggregate signature schemes we immediately obtain several concrete communication-efficient DVUF/DVRF instantiations.

Original languageEnglish
Title of host publicationCryptology and Network Security - 12th International Conference, CANS 2013, Proceedings
PublisherSpringer
Pages251-270
Number of pages20
ISBN (Print)9783319029368
DOIs
Publication statusPublished - 1 Jan 2013
Externally publishedYes
Event12th International Conference on Cryptology and Network Security, CANS 2013 - Paraty, Brazil
Duration: 20 Nov 201322 Nov 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8257 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Cryptology and Network Security, CANS 2013
CountryBrazil
CityParaty
Period20/11/1322/11/13

Cite this

Kuchta, V., & Manulis, M. (2013). Unique aggregate signatures with applications to distributed verifiable random functions. In Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings (pp. 251-270). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8257 LNCS). Springer. https://doi.org/10.1007/978-3-319-02937-5_14
Kuchta, Veronika ; Manulis, Mark. / Unique aggregate signatures with applications to distributed verifiable random functions. Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings. Springer, 2013. pp. 251-270 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e12ba16fb09145088cf3d01bd6fb3acf,
title = "Unique aggregate signatures with applications to distributed verifiable random functions",
abstract = "The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propose the first generic approach for building DVRFs, under much weaker setup assumptions, where we only require existence of a shared random string. More precisely, we first aim at constructions of Distributed Verifiable Unpredictable Functions (DVUF) that can then be converted to DVRF using inner products with a random string as specified by Micali, Rabin, and Vadhan (FOCS'99) for the non-distributed VUF/VRF case. Our main contribution are generic DVUF constructions from aggregate signatures that satisfy the property of uniqueness.We define uniqueness for two flavors of aggregate signatures (with public and sequential aggregation) and show that both flavors can be used to obtain DVUF. By proving uniqueness of existing pairing-based aggregate signature schemes we immediately obtain several concrete communication-efficient DVUF/DVRF instantiations.",
author = "Veronika Kuchta and Mark Manulis",
year = "2013",
month = "1",
day = "1",
doi = "10.1007/978-3-319-02937-5_14",
language = "English",
isbn = "9783319029368",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "251--270",
booktitle = "Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings",

}

Kuchta, V & Manulis, M 2013, Unique aggregate signatures with applications to distributed verifiable random functions. in Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8257 LNCS, Springer, pp. 251-270, 12th International Conference on Cryptology and Network Security, CANS 2013, Paraty, Brazil, 20/11/13. https://doi.org/10.1007/978-3-319-02937-5_14

Unique aggregate signatures with applications to distributed verifiable random functions. / Kuchta, Veronika; Manulis, Mark.

Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings. Springer, 2013. p. 251-270 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8257 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Unique aggregate signatures with applications to distributed verifiable random functions

AU - Kuchta, Veronika

AU - Manulis, Mark

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propose the first generic approach for building DVRFs, under much weaker setup assumptions, where we only require existence of a shared random string. More precisely, we first aim at constructions of Distributed Verifiable Unpredictable Functions (DVUF) that can then be converted to DVRF using inner products with a random string as specified by Micali, Rabin, and Vadhan (FOCS'99) for the non-distributed VUF/VRF case. Our main contribution are generic DVUF constructions from aggregate signatures that satisfy the property of uniqueness.We define uniqueness for two flavors of aggregate signatures (with public and sequential aggregation) and show that both flavors can be used to obtain DVUF. By proving uniqueness of existing pairing-based aggregate signature schemes we immediately obtain several concrete communication-efficient DVUF/DVRF instantiations.

AB - The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propose the first generic approach for building DVRFs, under much weaker setup assumptions, where we only require existence of a shared random string. More precisely, we first aim at constructions of Distributed Verifiable Unpredictable Functions (DVUF) that can then be converted to DVRF using inner products with a random string as specified by Micali, Rabin, and Vadhan (FOCS'99) for the non-distributed VUF/VRF case. Our main contribution are generic DVUF constructions from aggregate signatures that satisfy the property of uniqueness.We define uniqueness for two flavors of aggregate signatures (with public and sequential aggregation) and show that both flavors can be used to obtain DVUF. By proving uniqueness of existing pairing-based aggregate signature schemes we immediately obtain several concrete communication-efficient DVUF/DVRF instantiations.

UR - http://www.scopus.com/inward/record.url?scp=84893678646&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-02937-5_14

DO - 10.1007/978-3-319-02937-5_14

M3 - Conference Paper

SN - 9783319029368

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 251

EP - 270

BT - Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings

PB - Springer

ER -

Kuchta V, Manulis M. Unique aggregate signatures with applications to distributed verifiable random functions. In Cryptology and Network Security - 12th International Conference, CANS 2013, Proceedings. Springer. 2013. p. 251-270. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-02937-5_14