Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
From MaRDI portal
Publication:2835595
DOI10.1007/978-3-662-53018-4_15zbMath1379.94036OpenAlexW2480384353MaRDI QIDQ2835595
Joanne Woodage, Kenneth G. Paterson, Jean Paul Degabriele, Jacob C. N. Schuldt
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_15
Related Items (9)
Universally composable subversion-resilient cryptography ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Crooked indifferentiability of enveloped XOR revisited ⋮ Steganography-free zero-knowledge ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Immunization against complete subversion without random oracles ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic ⋮ Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
Uses Software
Cites Work
- Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
- Security of Symmetric Encryption against Mass Surveillance
- How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs
- Public Keys
- A More Cautious Approach to Security Against Mass Surveillance
- A Formal Treatment of Backdoored Pseudorandom Generators
- Cryptographic Reverse Firewalls
- Cliptography: Clipping the Power of Kleptographic Attacks
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Lossy trapdoor functions and their applications
- Deterministic and Efficiently Searchable Encryption
- Security in Communication Networks
This page was built for publication: Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
