scientific article
From MaRDI portal
Publication:3549622
zbMath1232.94020MaRDI QIDQ3549622
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Generalised Mersenne numbers revisited ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Communication-efficient distributed oblivious transfer ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Short Locally Testable Codes and Proofs ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Outlaw distributions and locally decodable codes ⋮ Local correctability of expander codes
This page was built for publication:
