Security Against Related Randomness Attacks via Reconstructive Extractors
From MaRDI portal
Publication:3460096
DOI10.1007/978-3-319-27239-9_2zbMath1376.94042OpenAlexW2400056066MaRDI QIDQ3460096
Dale L. Sibborn, Kenneth G. Paterson, Jacob C. N. Schuldt, Hoeteck Wee
Publication date: 12 January 2016
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_2
public-key encryptionauxiliary-inputsCIS hash functionsreconstructive extractorsrelated randomness attacks
Related Items (2)
Updatable all-but-one dual projective hashing and its applications ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience
Uses Software
Cites Work
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- Public Key Encryption against Related Key Attacks
- Public Keys
- Barriers in cryptography with weak, correlated and leaky sources
- Correlated-Input Secure Hash Functions
- Public-Key Encryption Schemes with Auxiliary Inputs
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Circular-Secure Encryption from Decision Diffie-Hellman
- Hedged Public-Key Encryption: How to Protect against Bad Randomness
- Randomly Failed! The State of Randomness in Current Java Implementations
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
- Advances in Cryptology – CRYPTO 2004
- Related Randomness Attacks for Public Key Encryption
- Topics in Cryptology – CT-RSA 2005
- Fast Software Encryption
This page was built for publication: Security Against Related Randomness Attacks via Reconstructive Extractors