Public-coin parallel zero-knowledge for NP (Q1946592)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Public-coin parallel zero-knowledge for NP	scientific article

Statements

scholarly article

0 references

Public-coin parallel zero-knowledge for NP (English)

0 references

0 references

0 references

Wei-Lung Dustin Tseng

0 references

Journal of Cryptology

0 references

publication date

15 April 2013

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-011-9110-5

0 references

0 references

Concurrent zero-knowledge

0 references

How to construct constant-round zero-knowledge proof systems for NP

0 references

On the Composition of Zero-Knowledge Proof Systems

0 references

Probabilistic encryption

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

Foundations of Cryptography

0 references

Concurrent zero-knowledge with timing, revisited

0 references

Definitions and properties of zero-knowledge proof systems

0 references

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

0 references

A Pseudorandom Generator from any One-way Function

0 references

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

0 references

Computationally Sound Proofs

0 references

Bit commitment using pseudorandomness

0 references

New and Improved Constructions of Nonmalleable Cryptographic Protocols

0 references

On the Composition of Public-Coin Zero-Knowledge Protocols

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00145-011-9110-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1946592

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1946592&oldid=38805032"