Feebly secure cryptographic primitives (Q1946841): Difference between revisions

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

Latest revision as of 09:02, 6 July 2024

scientific article
Language Label Description Also known as
English
Feebly secure cryptographic primitives
scientific article

    Statements

    Feebly secure cryptographic primitives (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2013
    0 references
    0 references
    cryptographic primitives
    0 references
    security
    0 references
    one-way functions
    0 references
    feebly secure trapdoor functions
    0 references
    0 references
    0 references