Feebly secure cryptographic primitives (Q1946841): Difference between revisions

@@ Property / author @@
+Sergey I. Nikolenko
@@ Property / author: Sergey I. Nikolenko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10958-012-1103-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2056184684
@@ Property / OpenAlex ID: W2056184684 / rank @@
+Normal rank
@@ Property / cites work @@
+A Boolean function requiring 3n network size
@@ Property / cites work: A Boolean function requiring 3n network size / rank @@
+Normal rank
@@ Property / cites work @@
+Gate Elimination for Linear Functions and New Feebly Secure Constructions
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+A Complete Public-Key Cryptosystem
@@ Property / cites work: A Complete Public-Key Cryptosystem / rank @@
+Normal rank
@@ Property / cites work @@
+On Robust Combiners for Oblivious Transfer and Other Primitives
+Normal rank
@@ Property / cites work @@
+Q4341710
@@ Property / cites work: Q4341710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249648
@@ Property / cites work: Q4249648 / rank @@
+Normal rank
@@ Property / cites work @@
+A Feebly Secure Trapdoor Function
@@ Property / cites work: A Feebly Secure Trapdoor Function / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit lower bound of             <i>4.5n - o(n)</i>             for boolena circuits
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Feebly secure cryptographic primitives
@@ Property / cites work: Feebly secure cryptographic primitives / rank @@
+Normal rank
@@ Property / cites work @@
+A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
+Normal rank
@@ Property / cites work @@
+Q4850554
@@ Property / cites work: Q4850554 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Q4172915
@@ Property / cites work: Q4172915 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Theory of Secrecy Systems*
@@ Property / cites work: Communication Theory of Secrecy Systems* / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinational complexity of certain symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank