Limits of practical sublinear secure computation

DOI10.1007/978-3-319-96878-0_11MaRDI QIDQ775973zbMATH OpenOpenAlexFDO

Authors Elette Boyle, Yuval Ishai, Antigoni Polychroniadou

Publication date 30 June 2020

Full work available at URL https://doi.org/10.1007/978-3-319-96878-0_11

zbMATH Keywords

secure computationlocally decodable codesprivate information retrievalsublinear communication

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Informational aspects of data analysis and big data (94A16)

Recommendations

• Sublinear secure computation from new assumptions
• The price of low communication in secure multi-party computation
• Secure computation for big data
• Communication Locality in Secure Multi-party Computation
• Efficient computations over encrypted data blocks

Cited in

(4)

• Secure computation for big data
• Sublinear secure computation from new assumptions
• Automata, Languages and Programming
• Limits of Constructive Security Proofs

This page was built for publication: Limits of practical sublinear secure computation

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