Securing circuits against constant-rate tampering
From MaRDI portal
Publication:2914282
DOI10.1007/978-3-642-32009-5_31zbMATH Open1296.94103OpenAlexW2281560505MaRDI QIDQ2914282FDOQ2914282
Authors: Dana Dachman-Soled, Yael Tauman Kalai 
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_31
Recommendations
- Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Tamper resilient circuits: the adversary at the gates
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Circuit compilers with \(O(1/\log (n))\) leakage rate
Cited In (16)
- Continuously non-malleable codes in the split-state model
- Locally decodable and updatable non-malleable codes and their applications
- Subversion-resilient signatures: definitions, constructions and applications
- Tamper resilient circuits: the adversary at the gates
- Efficiently testable circuits without conductivity
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Secure computation with information leaking to an adversary
- On the impossibility of cryptography with tamperable randomness
- The Chaining Lemma and its application
- Protection of Sensitive Security Parameters in Integrated Circuits
- Circuits resilient to additive attacks with applications to secure computation
- Bounded tamper resilience: how to go beyond the algebraic barrier
This page was built for publication: Securing circuits against constant-rate tampering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914282)
