scientific article; zbMATH DE number 5485460

MaRDI QIDQ3549622zbMATH OpenFDO

Authors Sergey Yekhanin

Publication date 5 January 2009

zbMATH Keywords

\(q\)-query locally decodable codeMersenne primeprivate information retrieval

Mathematics Subject Classification ID

Arithmetic codes (94B40) Other types of codes (94B60)

Cited in

(17)

• Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
• Homomorphic secret sharing for low degree polynomials
• Local correctability of expander codes
• Breaking the circuit size barrier for secure computation under DDH
• Short locally testable codes and proofs
• Communication-efficient distributed oblivious transfer
• Outlaw distributions and locally decodable codes
• Short locally testable codes and proofs: a survey in two parts
• Foundations of homomorphic secret sharing
• Generalised Mersenne numbers revisited
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound for online reads?
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR
• Efficient information-theoretic distributed point functions with general output groups
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• On the definition of malicious private information retrieval

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549622)