Interactive Coding for Interactive Proofs (Q2799101)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Interactive Coding for Interactive Proofs	scientific article

Statements

scholarly article

0 references

Interactive Coding for Interactive Proofs (English)

0 references

0 references

0 references

Theory of Cryptography

0 references

publication date

8 April 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-49099-0_13

0 references

Simple Constructions of Almost k-wise Independent Random Variables

0 references

Randomness in interactive proofs

0 references

Towards deterministic tree code constructions

0 references

List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise

0 references

Towards coding for maximum errors in interactive communication

0 references

Parallel Repetition Theorems for Interactive Arguments

0 references

Efficient and Explicit Coding for Interactive Communication

0 references

Private interactive communication across an adversarial channel

0 references

Optimal error rates for interactive coding I

0 references

0 references

An Efficient Parallel Repetition Theorem

0 references

Small-Bias Probability Spaces: Efficient Constructions and Applications

0 references

0 references

0 references

Deterministic coding for interactive communication

0 references

Coding for interactive communication

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-49099-0_13

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2799101

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