Secure computation for big data

DOI10.1007/978-3-642-36594-2_20MaRDI QIDQ4910287zbMATH OpenOpenAlexFDO

Authors Tal Malkin

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_20

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Limits of practical sublinear secure computation
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Efficient computations over encrypted data blocks
• Secure computation on the web: computing without simultaneous interaction
• Techniques for Efficient Secure Computation Based on Yao’s Protocol

Cited in

(4)

• Secure Tensor Decomposition for Big Data Using Transparent Computing Paradigm
• Secure and traceable framework for data circulation
• scientific article; zbMATH DE number 6747316 (Why is no real title available?)
• Limits of practical sublinear secure computation

This page was built for publication: Secure computation for big data

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