Paillier's trapdoor function hides \(\Theta(n)\) bits

DOI10.1007/s11432-011-4269-9zbMath1267.94096OpenAlexW2008256813MaRDI QIDQ350942

Dong Su, Kewei Lü

Publication date: 3 July 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4269-9

zbMATH Keywords

hard-core predicatehard-core functionmost significant bitPaillier's trapdoor functionsimultaneous security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Lattice-based key exchange on small integer solution problem

Cites Work

• Unnamed Item
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Paillier's trapdoor function hides up to \(O(n)\) bits
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Simultaneous Security of Bits in the Discrete Log
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The Discrete Logarithm Hides $O(\log n)$ Bits
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography

This page was built for publication: Paillier's trapdoor function hides \(\Theta(n)\) bits