Theory of Cryptography
From MaRDI portal
Publication:5901776
DOI10.1007/b95566zbMath1197.94187OpenAlexW2498336418MaRDI QIDQ5901776
Silvio Micali, Tal Rabin, Anna Lysyanskaya, Rosario Gennaro, Tal Malkin
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ One-Time Programs with Limited Memory ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system ⋮ Public key encryption resilient to leakage and tampering attacks ⋮ Public-key encryption for protecting data in cloud system with intelligent agents against side-channel attacks ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ The Chaining Lemma and Its Application ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Detection of Algebraic Manipulation in the Presence of Leakage ⋮ On the impossibility of cryptography with tamperable randomness ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Trojan-resilience without cryptography ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Secure computation without computers ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ Private Circuits II: Keeping Secrets in Tamperable Circuits ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ One-Time Programs ⋮ Continuously non-malleable codes with split-state refresh ⋮ A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens