Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
From MaRDI portal
Publication:2948398
DOI10.1007/978-3-662-46803-6_21zbMath1375.94100OpenAlexW2182584071MaRDI QIDQ2948398
Mihir Bellare, Viet Tung Hoang
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_21
Related Items (19)
Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Security of public key encryption against resetting attacks ⋮ Cliptography: Clipping the Power of Kleptographic Attacks ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions ⋮ Steganography-free zero-knowledge ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Subvert KEM to break DEM: practical algorithm-substitution attacks on public-key encryption ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Public-Seed Pseudorandom Permutations ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Subversion-resilient public key encryption with practical watchdogs ⋮ Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
This page was built for publication: Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
