Extracting correlations
From MaRDI portal
Recommendations
- Correlation Extractors and Their Applications
- Correlated-source extractors and cryptography with correlated-random tapes
- Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
- Secure computation based on leaky correlations: high resilience setting
- Secure computation from leaky correlated randomness
Cited in
(21)- Correlation Extractors and Their Applications
- Oblivious transfer with constant computational overhead
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Privacy amplification with asymptotically optimal entropy loss
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Secure computation based on leaky correlations: high resilience setting
- Correlated pseudorandomness from expand-accumulate codes
- LATIN 2004: Theoretical Informatics
- Secure computation from leaky correlated randomness
- On the (im)possibility of non-interactive correlation distillation
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Asymptotically quasi-optimal cryptography
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- Correlated-source extractors and cryptography with correlated-random tapes
- Direct evaluation of the desired correlations: verification on real data
- Group Structure in Correlations and Its Applications in Cryptography.
- Computational two-party correlation: a dichotomy for key-agreement protocols
- Detection of correlations
- Secret Sharing Schemes with Algebraic Properties and Applications
- scientific article; zbMATH DE number 1418319 (Why is no real title available?)
This page was built for publication: Extracting correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171210)