On the streaming indistinguishability of a random permutation and a random function (Q2119020): Difference between revisions

From MaRDI portal
Added link to MaRDI 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/978-3-030-45724-2_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2970326168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information complexity approach to extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Monte Carlo factorization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic indistinguishability via the chi-squared method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight time-memory trade-offs for symmetric encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monte carlo method for factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121897 / rank
 
Normal rank

Latest revision as of 10:16, 28 July 2024

scientific article
Language Label Description Also known as
English
On the streaming indistinguishability of a random permutation and a random function
scientific article

    Statements

    On the streaming indistinguishability of a random permutation and a random function (English)
    0 references
    0 references
    23 March 2022
    0 references
    streaming algorithm
    0 references
    time-memory tradeoff
    0 references
    communication complexity
    0 references
    provable security
    0 references
    switching lemma
    0 references
    mode of operation
    0 references

    Identifiers