Time- and space-efficient arguments from groups of unknown order (Q2139631): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Spartan / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Marlin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3147459559 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:08, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time- and space-efficient arguments from groups of unknown order |
scientific article |
Statements
Time- and space-efficient arguments from groups of unknown order (English)
0 references
18 May 2022
0 references
This paper constructs public-coin time- and space-efficient zero-knowledge arguments for NP. Every time \(T\) and space $S$ non-deterministic RAM computation, the prover runs in time $T\cdot \text{ polylog}(T)$ and space $S\cdot\text{ polylog}(T)$, and the verifier runs in time $n\cdot\text{ polylog}(T)$ where \(n\) is the input length. This protocol relies on hidden order groups, which can be instantiated with a trusted setup from the hardness of factoring (products of safe primes), or without a trusted setup using class groups. The argument system can heuristically be made non-interactive using the Fiat-Shamir transform. For the entire collection see [Zbl 1486.94003].
0 references
space-efficient zero-knowledge
0 references
public-coin zero-knowledge
0 references