How to compute under AC^0 leakage without secure hardware

DOI10.1007/978-3-642-32009-5_32MaRDI QIDQ2914283zbMATH OpenOpenAlexFDO

Authors Guy N. Rothblum

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_32

Mathematics Subject Classification ID

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

Recommendations

• How to Compute in the Presence of Leakage
• Unconditionally secure computation against low-complexity leakage
• Unconditionally secure computation against low-complexity leakage
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Protecting circuits from computationally bounded and noisy leakage

Cited in

(22)

• On the impossibility of cryptography with tamperable randomness
• Unifying leakage models: from probing attacks to noisy leakage
• Adaptive extractors and their application to leakage resilient secret sharing
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Locally decodable and updatable non-malleable codes and their applications
• Efficient leakage resilient circuit compilers
• Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
• How to Compute in the Presence of Leakage
• scientific article; zbMATH DE number 7561745 (Why is no real title available?)
• Secure computation with information leaking to an adversary
• Unconditionally secure computation against low-complexity leakage
• On the local leakage resilience of linear secret sharing schemes
• Unconditionally secure computation against low-complexity leakage
• Correction to: ``Unconditionally secure computation against low-complexity leakage
• Short leakage resilient and non-malleable secret sharing schemes
• New bounds on the local leakage resilience of Shamir's secret sharing scheme
• Limits of preprocessing
• Leakage-tolerant circuits
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Leakage-resilient circuits against \textsf{NC1}, revisited
• Bounded simultaneous messages
• An improvement upon the bounds for the local leakage resilience of Shamir's secret sharing scheme

This page was built for publication: How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware

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