The cost of adaptivity in security games on graphs (Q2697875): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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-90453-1_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3198322958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security analysis and improvements for the IETF MLS standard for group messaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Parallel Complexity Graphs and Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking RSA may not be equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Pseudorandom Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Signatures and Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics for the East model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Proofs of Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Computable Self-erasing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasipolynomial Reduction for Generalized Selective Decryption on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively secure proxy re-encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Security of Constrained PRFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive garbled RAM from laconic oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively secure garbling with near optimal online complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Efficiency of Generic Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Garbled Circuits from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Be adaptive, avoid overcommitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Security of Yao’s Garbled Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the adaptive security of Yao's garbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact NIZKs from standard assumptions on bilinear maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Proving HIBE Systems Secure Is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tackling Adaptive Corruptions in Multicast Encryption Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249649 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:37, 31 July 2024

scientific article
Language Label Description Also known as
English
The cost of adaptivity in security games on graphs
scientific article

    Statements

    The cost of adaptivity in security games on graphs (English)
    0 references
    0 references
    13 April 2023
    0 references
    security of cryptographic primitives
    0 references
    cryptographic protocols
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references