Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
From MaRDI portal
Publication:2829209
DOI10.1007/978-3-662-53008-5_1zbMATH Open1372.94444OpenAlexW2502826599MaRDI QIDQ2829209FDOQ2829209
Noboru Kunihiro, Shota Yamada, Takashi Yamakawa, Goichiro Hanaoka
Publication date: 27 October 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-53008-5_1
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability Inequalities for Sums of Bounded Random Variables
- On lattices, learning with errors, random linear codes, and cryptography
- Factoring integers with elliptic curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- A monte carlo method for factorization
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Simple Unpredictable Pseudo-Random Number Generator
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Lossy trapdoor functions and their applications
- Theory of Cryptography
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
- The Group of Signed Quadratic Residues and Applications
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security
- Deterministic and Efficiently Searchable Encryption
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Improved Efficiency of Chosen Ciphertext Secure Encryption from Factoring
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- How to Remove the Exponent GCD in HK09
- Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues
- Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
Cited In (1)
This page was built for publication: Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829209)
