Paillier's trapdoor function hides \(\Theta(n)\) bits
type: Item
instance of: scholarly article
title: Paillier's trapdoor function hides \(\Theta(n)\) bits
zbMATH Open document ID: 1267.94096
author: Dong Su
author: Kewei Lü
publication date: 2013-07-03T00:00:00Z
full work available at URL: s11432-011-4269-9
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6183269
zbMATH Keywords: Paillier's trapdoor function
zbMATH Keywords: hard-core predicate
zbMATH Keywords: hard-core function
zbMATH Keywords: simultaneous security
zbMATH Keywords: most significant bit
MaRDI profile type: Publication
OpenAlex ID: W2008256813
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: RSA and Rabin Functions: Certain Parts are as Hard as the Whole
cites work: The Discrete Logarithm Hides $O(\log n)$ Bits
cites work: Simultaneous Security of Bits in the Discrete Log
cites work: On the security of modular exponentiation with application to the construction of pseudorandom generators
cites work: The discrete logarithm modulo a composite hides \(O(n)\) bits
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Paillier's trapdoor function hides up to \(O(n)\) bits
cites work: Foundations of Cryptography
cites work: Q4782729
DOI: 10.1007/S11432-011-4269-9
published in: Science China Information Sciences
description: scientific article; zbMATH DE number 6183269