How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500): Difference between revisions

Latest revision as of 17:19, 27 June 2024

scientific article; zbMATH DE number 5242849

Language	Label	Description	Also known as
English	How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge	scientific article; zbMATH DE number 5242849

Statements

instance of

scholarly article

0 references

title

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

0 references

author

Lior Malka

0 references

published in

Theory of Cryptography

0 references

publication date

5 March 2008

0 references

zbMATH Keywords

cryptography

0 references

non-interactive

0 references

perfect zero-knowledge

0 references

perfect simulation

0 references

error shifting

0 references

complete problems

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-78524-8_6

0 references

cites work

Statistical zero-knowledge languages can be recognized in two rounds

0 references

Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes

0 references

Q3826476

0 references

Noninteractive Zero-Knowledge

0 references

Q4341736

0 references

The complexity of promise problems with applications to public-key cryptography

0 references

Foundations of Cryptography

0 references

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

0 references

Q4542558

0 references

Q4941874

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

Perfect Non-interactive Zero Knowledge for NP

0 references

A language-dependent cryptographic primitive

0 references

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)

0 references

Zero knowledge with efficient provers

0 references

On relationships between statistical zero-knowledge proofs

0 references

A complete problem for statistical zero knowledge

0 references

The knowledge complexity of quadratic residuosity languages

0 references

Randomness-efficient non-interactive zero knowledge

0 references

Mathematical Foundations of Computer Science 2004

0 references

Identifiers

zbMATH Open document ID

1162.94390

0 references

DOI

10.1007/978-3-540-78524-8_6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5445500

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-78524-8_6
+Normal rank
@@ Property / OpenAlex ID @@
+W1821685473
@@ Property / OpenAlex ID: W1821685473 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Q3826476
@@ Property / cites work: Q3826476 / rank @@
+Normal rank
@@ Property / cites work @@
+Noninteractive Zero-Knowledge
@@ Property / cites work: Noninteractive Zero-Knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341736
@@ Property / cites work: Q4341736 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Q4542558
@@ Property / cites work: Q4542558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941874
@@ Property / cites work: Q4941874 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Perfect Non-interactive Zero Knowledge for NP
@@ Property / cites work: Perfect Non-interactive Zero Knowledge for NP / rank @@
+Normal rank
@@ Property / cites work @@
+A language-dependent cryptographic primitive
@@ Property / cites work: A language-dependent cryptographic primitive / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
+Normal rank
@@ Property / cites work @@
+Zero knowledge with efficient provers
@@ Property / cites work: Zero knowledge with efficient provers / rank @@
+Normal rank
@@ Property / cites work @@
+On relationships between statistical zero-knowledge proofs
+Normal rank
@@ Property / cites work @@
+A complete problem for statistical zero knowledge
@@ Property / cites work: A complete problem for statistical zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of quadratic residuosity languages
+Normal rank
@@ Property / cites work @@
+Randomness-efficient non-interactive zero knowledge
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank