Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli

DOI10.1007/978-3-662-53008-5_1zbMATH Open1372.94444OpenAlexW2502826599MaRDI QIDQ2829209FDOQ2829209

Authors: Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro 

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

Recommendations

• Chosen-ciphertext security from slightly lossy trapdoor functions
• Lossy Trapdoor Functions and Their Applications
• Lossy trapdoor functions and their applications
• Extended-DDH and lossy trapdoor functions
• Lossy trapdoor permutations with improved lossiness

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• On lattices, learning with errors, random linear codes, and cryptography
• Title not available (Why is that?)
• 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)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF

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)