Paillier's trapdoor function hides up to \(O(n)\) bits
type: Item
instance of: scholarly article
title: Paillier's trapdoor function hides up to \(O(n)\) bits
zbMATH Open document ID: 1024.94008
author: Dario Catalano
author: Rosario Gennaro
author: N. A. Howgrave-Graham
published in: Journal of Cryptology
publication date: 2003-03-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 1887498
zbMATH Keywords: trapdoor functions
zbMATH Keywords: bit security
zbMATH Keywords: semantic security
zbMATH Keywords: Paillier's scheme
MaRDI profile type: Publication
full work available at URL: s00145-002-0112-1
OpenAlex ID: W1510582395
DOI: 10.1007/S00145-002-0112-1
Recommended article: Paillier's trapdoor function hides \(\Theta(n)\) bits
Recommended article: A New Hard-Core Predicate of Paillier’s Trapdoor Function
Recommended article: Trapdoor functions from the computational Diffie-Hellman assumption
Recommended article: All-But-Many Lossy Trapdoor Functions
Recommended article: Rate-1 trapdoor functions from the Diffie-Hellman problem
Recommended article: On the Lossiness of the Rabin Trapdoor Function
Recommended article: Trapdoor hash functions and their applications
Recommended article: Hiding information and signatures in trapdoor knapsacks
Recommended article: Q4249337
Recommended article: Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
description: scientific article; zbMATH DE number 1887498