The following pages link to Theory of Cryptography (Q5901776):
Displaying 41 items.
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Secure computation without computers (Q517015) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system (Q1647557) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Practical continuously non-malleable randomness encoders in the random oracle model (Q2149829) (← links)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Public key encryption resilient to leakage and tampering attacks (Q2402358) (← links)
- Public-key encryption for protecting data in cloud system with intelligent agents against side-channel attacks (Q2403460) (← links)
- Trojan-resilience without cryptography (Q2697869) (← links)
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions (Q2946437) (← links)
- The Chaining Lemma and Its Application (Q2947530) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- Leakage Resilience of the Blom’s Key Distribution Scheme (Q2948266) (← links)
- Detection of Algebraic Manipulation in the Presence of Leakage (Q2948267) (← links)
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience (Q2958151) (← links)
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions (Q2958152) (← links)
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience (Q3012821) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Algorithmic Tamper-Proof Security under Probing Attacks (Q3588333) (← links)
- Private Circuits II: Keeping Secrets in Tamperable Circuits (Q3593103) (← links)
- One-Time Programs (Q3600212) (← links)
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches (Q3617507) (← links)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks (Q3627450) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
- More efficient public-key cryptography with leakage and tamper resilience (Q6635891) (← links)
