Efficient computations over encrypted data blocks

DOI10.1007/978-3-662-48054-0_23MaRDI QIDQ2946399zbMATH OpenOpenAlexFDO

Authors Giovanni Crescenzo, Brian A. Coan, Jonathan Kirsch

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_23

Mathematics Subject Classification ID

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

Recommendations

• Efficient non-interactive secure computation
• Practical Two-Party Computation Based on the Conditional Gate
• Efficient Two-Party Secure Computation on Committed Inputs
• Fast garbling of circuits under standard assumptions
• Techniques for Efficient Secure Computation Based on Yao’s Protocol

Cites work

• Conditional Oblivious Transfer and Timed-Release Encryption
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Foundations of Cryptography
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1759348 (Why is no real title available?)
• Secure multiparty computation goes live
• Theory of Cryptography

Cited in

(7)

• Efficient coding for secure computing with additively-homomorphic encrypted data
• Secure computation, I/O-efficient algorithms and distributed signatures
• Towards Robust Computation on Encrypted Data
• Secure computation for big data
• Two-Party Computing with Encrypted Data
• Practical Two-Party Computation Based on the Conditional Gate
• Limits of practical sublinear secure computation

This page was built for publication: Efficient computations over encrypted data blocks

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