Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli

DOI10.1007/978-3-662-53008-5_1zbMath1372.94444OpenAlexW2502826599MaRDI QIDQ2829209

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• How to Remove the Exponent GCD in HK09
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Improved Efficiency of Chosen Ciphertext Secure Encryption from Factoring
• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
• 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
• Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
• The Group of Signed Quadratic Residues and Applications
• Lossy trapdoor functions and their applications
• More Constructions of Lossy and Correlation-Secure Trapdoor Functions
• Adaptive Trapdoor Functions and Chosen-Ciphertext Security
• Instantiability of RSA-OAEP under Chosen-Plaintext Attack
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• Secure Hybrid Encryption from Weakened Key Encapsulation
• 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
• Practical Chosen Ciphertext Secure Encryption from Factoring
• A New Randomness Extraction Paradigm for Hybrid Encryption
• A Simple Unpredictable Pseudo-Random Number Generator
• A monte carlo method for factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
• Probability Inequalities for Sums of Bounded Random Variables
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli