Extracting Correlations
From MaRDI portal
Publication:5171210
DOI10.1109/FOCS.2009.56zbMath1292.94080OpenAlexW2295416995MaRDI QIDQ5171210
Amit Sahai, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2009.56
Cryptography (94A60) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (9)
Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Asymptotically quasi-optimal cryptography ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ Oblivious transfer with constant computational overhead ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Privacy amplification with asymptotically optimal entropy loss ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
This page was built for publication: Extracting Correlations
