On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols

DOI10.1007/978-3-540-89255-7_21MaRDI QIDQ3600384zbMATH OpenOpenAlexFDO

Authors Christian Schridde, Bernd Freisleben

Publication date 10 February 2009

Published in Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89255-7_21

zbMATH Keywords

\(\Phi \)-Hiding assumptionEuler's totient functionJacobi symbol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Improved cryptanalysis of the multi-prime -hiding assumption
• Cryptanalysis of multi-prime \(\varPhi \)-hiding assumption
• Optimal bounds for multi-prime -hiding assumption
• scientific article; zbMATH DE number 1304086
• The hidden number problem with non-prime modulus

Cites work

• Automata, Languages and Programming
• Efficient algorithms for computing the Jacobi symbol
• Fair encryption of RSA keys
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)

Cited in

(6)

• Optimal security proofs for full domain hash. Revisited
• Cryptanalysis of multi-prime \(\varPhi \)-hiding assumption
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Improved cryptanalysis of the multi-prime -hiding assumption
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• New results on the -hiding assumption and factoring related RSA moduli

This page was built for publication: On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600384)