Adaptively secure computation with partial erasures

DOI10.1145/2767386.2767400MaRDI QIDQ2796264zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Yehuda Lindell, Arpita Patra

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767400

zbMATH Keywords

adaptive securityerasurenon-committing encryptionoblivious transfersecure computation

Mathematics Subject Classification ID

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

Recommendations

• Adaptively Secure Two-Party Computation with Erasures
• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 5009201
• Efficient one-sided adaptively secure computation
• Adaptive security of multi-party protocols, revisited

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(12)

• Adaptively secure computation for RAM programs
• Memory erasability amplification
• Efficient Proofs of Secure Erasure
• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• How to Protect Yourself without Perfect Shredding
• Adaptively Secure Two-Party Computation with Erasures
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• Efficient one-sided adaptively secure computation
• Removing erasures with explainable hash proof systems
• Theory of Cryptography
• Adaptively secure MPC with sublinear communication complexity
• Completeness theorems for adaptively secure broadcast

This page was built for publication: Adaptively secure computation with partial erasures

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