Super-Perfect Zero-Knowledge Proofs (Q5098773)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7578385

Language	Label	Description	Also known as
English	Super-Perfect Zero-Knowledge Proofs	scientific article; zbMATH DE number 7578385

Statements

scholarly article

0 references

Super-Perfect Zero-Knowledge Proofs (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

30 August 2022

0 references

full work available at URL

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.260

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

RSA and Rabin Functions: Certain Parts are as Hard as the Whole

0 references

Noninteractive Zero-Knowledge

0 references

Minimum disclosure proofs of knowledge

0 references

Foundations of Cryptography

0 references

Foundations of Cryptography

0 references

Computational Complexity

0 references

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

0 references

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

Perfect Non-interactive Zero Knowledge for NP

0 references

BPP and the polynomial hierarchy

0 references

How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge

0 references

Perfect zero-knowledge arguments for NP using any one-way permutation

0 references

New and Improved Constructions of Nonmalleable Cryptographic Protocols

0 references

Concurrent Nonmalleable Commitments

0 references

A complete problem for statistical zero knowledge

0 references

Identifiers

10.1007/978-3-030-43662-9_8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5098773

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