Paillier's trapdoor function hides $\Theta(n)$ bits (Q350942): Difference between revisions

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

Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942): Difference between revisions