Secure computation against adaptive auxiliary information

DOI10.1007/978-3-642-40041-4_18zbMATH Open1310.94132OpenAlexW1606640167MaRDI QIDQ2845680FDOQ2845680

Authors: Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Amit Sahai 

Publication date: 2 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_18

Recommendations

• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 1302802
• Two-round adaptively secure multiparty computation from standard assumptions
• Adaptive security of multi-party protocols, revisited
• Multiparty computation secure against continual memory leakage

Mathematics Subject Classification ID

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

Cited In (14)

• Enabling cloud storage auditing with key-exposure resilience under continual key-leakage
• Correction to: ``Unconditionally secure computation against low-complexity leakage
• Multiparty computation secure against continual memory leakage
• Secure computation from leaky correlated randomness
• Constant-round leakage-resilient zero-knowledge from collision resistance
• Impossibility of black-box simulation against leakage attacks
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Leakage-resilient coin tossing
• On-line/off-line leakage resilient secure computation protocols
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Memory leakage-resilient secret sharing schemes
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Unconditionally secure computation against low-complexity leakage
• On Invertible Sampling and Adaptive Security

This page was built for publication: Secure computation against adaptive auxiliary information

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