![]() ![]() We prove lower bounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and broadcast encryption schemes. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. A broad theoretical framework was introduced by Jafargholi et al. The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. ![]() Paper 2021/059 The Cost of Adaptivity in Security Games on GraphsĬhethan Kamath, Karen Klein, Krzysztof Pietrzak, and Michael Walter
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |