TU Darmstadt / ULB / TUbiblio

Single-to-Multi-Theorem Transformations for Non-Interactive Statistical Zero-Knowledge

Fischlin, Marc ; Rohrbach, Felix (2021)
Single-to-Multi-Theorem Transformations for Non-Interactive Statistical Zero-Knowledge.
24th International Conference on Practice and Theory of Public-Key Cryptography. virtual Conference (10.-13.05.2021)
doi: 10.1007/978-3-030-75248-4_8
Conference or Workshop Item, Bibliographie

Abstract

Non-interactive zero-knowledge proofs or arguments allow a prover to show validity of a statement without further interaction. For non-trivial statements such protocols require a setup assumption in form of a common random or reference string (CRS). Generally, the CRS can only be used for one statement (single-theorem zero-knowledge) such that a fresh CRS would need to be generated for each proof. Fortunately, Feige, Lapidot and Shamir (FOCS 1990) presented a transformation for any non-interactive zero-knowledge proof system that allows the CRS to be reused any polynomial number of times (multi-theorem zero-knowledge). This FLS transformation, however, is only known to work for either computational zero-knowledge or requires a structured, non-uniform common reference string. In this paper we present FLS-like transformations that work for non-interactive statistical zero-knowledge arguments in the common random string model. They allow to go from single-theorem to multi-theorem zero-knowledge and also preserve soundness, for both properties in the adaptive and non-adaptive case. Our first transformation is based on the general assumption that one-way permutations exist, while our second transformation uses lattice-based assumptions. Additionally, we define different possible soundness notions for non-interactive arguments and discuss their relationships.

Item Type: Conference or Workshop Item
Erschienen: 2021
Creators: Fischlin, Marc ; Rohrbach, Felix
Type of entry: Bibliographie
Title: Single-to-Multi-Theorem Transformations for Non-Interactive Statistical Zero-Knowledge
Language: English
Date: 1 May 2021
Publisher: Springer
Book Title: Public-Key Cryptography - PKC 2021
Series: Lecture Notes in Computer Science
Series Volume: 12711
Event Title: 24th International Conference on Practice and Theory of Public-Key Cryptography
Event Location: virtual Conference
Event Dates: 10.-13.05.2021
DOI: 10.1007/978-3-030-75248-4_8
URL / URN: https://pkc.iacr.org/2021/
Corresponding Links:
Abstract:

Non-interactive zero-knowledge proofs or arguments allow a prover to show validity of a statement without further interaction. For non-trivial statements such protocols require a setup assumption in form of a common random or reference string (CRS). Generally, the CRS can only be used for one statement (single-theorem zero-knowledge) such that a fresh CRS would need to be generated for each proof. Fortunately, Feige, Lapidot and Shamir (FOCS 1990) presented a transformation for any non-interactive zero-knowledge proof system that allows the CRS to be reused any polynomial number of times (multi-theorem zero-knowledge). This FLS transformation, however, is only known to work for either computational zero-knowledge or requires a structured, non-uniform common reference string. In this paper we present FLS-like transformations that work for non-interactive statistical zero-knowledge arguments in the common random string model. They allow to go from single-theorem to multi-theorem zero-knowledge and also preserve soundness, for both properties in the adaptive and non-adaptive case. Our first transformation is based on the general assumption that one-way permutations exist, while our second transformation uses lattice-based assumptions. Additionally, we define different possible soundness notions for non-interactive arguments and discuss their relationships.

Uncontrolled Keywords: Solutions, S4
Additional Information:

Proceedings, Part II

Divisions: 20 Department of Computer Science
20 Department of Computer Science > Cryptography and Complexity Theory
DFG-Collaborative Research Centres (incl. Transregio)
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres
Profile Areas
Profile Areas > Cybersecurity (CYSEC)
Forschungsfelder
Forschungsfelder > Information and Intelligence
Forschungsfelder > Information and Intelligence > Cybersecurity & Privacy
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments
Date Deposited: 01 Mar 2021 07:38
Last Modified: 09 Sep 2022 08:32
PPN:
Corresponding Links:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details