A Proof of Security in O(2 n ) for the Benes Scheme (Q3506381): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Foiling Birthday Attacks in Length-Doubling Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of pseudorandom permutations: Luby-Rackoff revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Cryptology - ICISC 2005 / rank
 
Normal rank

Latest revision as of 11:56, 28 June 2024

scientific article
Language Label Description Also known as
English
A Proof of Security in O(2 n ) for the Benes Scheme
scientific article

    Statements

    A Proof of Security in O(2 n ) for the Benes Scheme (English)
    0 references
    0 references
    13 June 2008
    0 references
    0 references
    pseudorandom function
    0 references
    unconditional security
    0 references
    information-theoretic primitive
    0 references
    design of keyed hash functions
    0 references
    security above the birthday bound
    0 references
    0 references