The cost of adaptivity in security games on graphs

DOI10.1007/978-3-030-90453-1_19OpenAlexW3198322958MaRDI QIDQ2697875

Yanyan Li

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_19

zbMATH Keywords

cryptographic protocolssecurity of cryptographic primitives

Mathematics Subject Classification ID

Games involving graphs (91A43) Cryptography (94A60) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

The power of undirected rewindings for adaptive security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive garbled RAM from laconic oblivious transfer
• Games against nature
• Adaptively secure garbling with near optimal online complexity
• Be adaptive, avoid overcommitting
• Compact NIZKs from standard assumptions on bilinear maps
• Security analysis and improvements for the IETF MLS standard for group messaging
• Limits on the adaptive security of Yao's garbling
• Adaptively secure proxy re-encryption
• Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
• Positional games
• Adaptively Secure Garbled Circuits from One-Way Functions
• Constrained Pseudorandom Functions and Their Applications
• Adaptive Security of Constrained PRFs
• High Parallel Complexity Graphs and Memory-Hard Functions
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• One-Time Computable Self-erasing Functions
• Adaptive Security of Yao’s Garbled Circuits
• A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Time/Space Trade-Offs for Reversible Computation
• Breaking RSA may not be equivalent to factoring
• Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Functional Signatures and Pseudorandom Functions
• Why Proving HIBE Systems Secure Is Difficult
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Pebbling and Proofs of Work
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography
• Combinatorics for the East model

This page was built for publication: The cost of adaptivity in security games on graphs