Statistical randomized encodings: a complexity theoretic view
From MaRDI portal
Recommendations
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Succinct randomized encodings and their applications
- Output-compressing randomized encodings and applications
- Computationally private randomizing polynomials and their applications
Cites work
- A complete problem for statistical zero knowledge
- A minimal model for secure computation (extended abstract)
- Computationally private randomizing polynomials and their applications
- Cryptography in NC^0
- Cryptography in constant parallel time
- Easy Decision Diffie-Hellman Groups
- From randomizing polynomials to parallel algorithms
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Relativized perfect zero knowledge is not BPP
Cited in
(18)- On pseudorandom encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the power of secure two-party computation
- Computationally private randomizing polynomials and their applications
- Output-compressing randomized encodings and applications
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Succinct randomized encodings and their applications
- Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy
- Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests
- scientific article; zbMATH DE number 1337738 (Why is no real title available?)
- scientific article; zbMATH DE number 1984078 (Why is no real title available?)
- Garbled circuits as randomized encodings of functions: a primer
- On the power of statistical zero knowledge
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- scientific article; zbMATH DE number 7650434 (Why is no real title available?)
- Additive randomized encodings and their applications
- Instance-hiding interactive proofs (extended abstract)
- Instance-hiding interactive proofs
This page was built for publication: Statistical randomized encodings: a complexity theoretic view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448769)
