Secure computation with information leaking to an adversary

DOI10.1145/1993636.1993731MaRDI QIDQ5419142zbMATH OpenOpenAlexFDO

Authors Miklós Ajtai

Publication date 5 June 2014

Published in Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

Boolean circuitramsidechannel attack

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• How to Compute in the Presence of Leakage
• Securing circuits against constant-rate tampering
• Private circuits: a modular approach
• How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

Cited in

(20)

• Unifying leakage models: from probing attacks to noisy leakage
• Minimizing locality of one-way functions via semi-private randomized encodings
• On the power of expansion: more efficient constructions in the random probing model
• Random probing security: verification, composition, expansion and new constructions
• Towards tight random probing security
• A group identification protocol with leakage resilience of secret sharing scheme
• What Information Is Leaked under Concurrent Composition?
• A tamper and leakage resilient von Neumann architecture
• How to Compute in the Presence of Leakage
• Theory of Cryptography
• Unconditionally secure computation against low-complexity leakage
• Correction to: ``Unconditionally secure computation against low-complexity leakage
• Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
• Dynamic random probing expansion with quasi linear asymptotic complexity
• From random probing to noisy leakages without field-size dependence
• A low-cost memory remapping scheme for address bus protection
• Masked circuit compiler in the cardinal random probing composability framework
• New techniques for random probing security and application to Raccoon signature scheme
• Formal definition and verification for combined random fault and random probing security
• PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling

This page was built for publication: Secure computation with information leaking to an adversary

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