Instantiability of classical random-oracle-model encryption transforms
From MaRDI portal
Publication:6175981
DOI10.1007/978-3-031-22972-5_12zbMath1519.94178OpenAlexW4317928322MaRDI QIDQ6175981
Alice Murphy, Mohammad Zaheri, Adam O'Neill
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_12
standard modelrandom oraclechosen-ciphertext securityextremely lossy functionsFujisaki-OkamotoRSA-OAEP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Probabilistic encryption
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- From obfuscation to the security of Fiat-Shamir for proofs
- A modular analysis of the Fujisaki-Okamoto transformation
- OAEP reconsidered
- RSA-OAEP is secure under the RSA assumption
- Secure integration of asymmetric and symmetric encryption schemes
- Generic authenticated key exchange in the quantum random oracle model
- On perfect correctness in (lockable) obfuscation
- Candidate obfuscation via oblivious LWE sampling
- Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
- A note on the bivariate Coppersmith theorem
- Authenticated encryption in the face of protocol and side channel leakage
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- The Magic of ELFs
- Instantiating Random Oracles via UCEs
- Building Lossy Trapdoor Functions from Lossy Encryption
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Point Obfuscation and 3-Round Zero-Knowledge
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Using Indistinguishability Obfuscation via UCEs
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Function Secret Sharing
- The random oracle methodology, revisited
- Lossy Trapdoor Functions and Their Applications
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- On Strong Simulation and Composable Point Obfuscation
- A Provable-Security Treatment of the Key-Wrap Problem
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Deterministic and Efficiently Searchable Encryption
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- A Pseudorandom Generator from any One-way Function
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Toward RSA-OAEP Without Random Oracles
- On cryptography with auxiliary input
- Cryptographic defense against traffic analysis
- How to use indistinguishability obfuscation
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- Obfuscating Point Functions with Multibit Output
- On the Security of OAEP
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Theory of Cryptography
- Chosen Ciphertext Security via Point Obfuscation
- Theory of Cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
