Keeping the SZK-verifier honest unconditionally (Q4364541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1088225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Keeping the SZK-verifier honest unconditionally |
scientific article; zbMATH DE number 1088225 |
Statements
10 February 1998
0 references
statistical zero-knowledge proofs
0 references
simulation
0 references
0.8180315494537354
0 references
0.7954086661338806
0 references
0.787895679473877
0 references
0.7872552871704102
0 references
Keeping the SZK-verifier honest unconditionally (English)
0 references
This paper shows that using direct properties of a zero-knowledge protocol itself, one may impose an honest behavior on the verifier (without additional cryptographic tools). The main technical contribution is showing that if a language \(L\) has an Arthur-Merlin (i.e. public coins) honest-verifier SZK proof system then \(L\) has an (any-verifier) SZK proof system when we use a non-uniform simulation model of SZK (where the simulation view and protocol view can be made statistically closer than any given polynomial given as a parameter). For the entire collection see [Zbl 0870.00047].
0 references
