A quasipolynomial reduction for generalized selective decryption on trees

DOI10.1007/978-3-662-47989-6_29zbMATH Open1375.94125OpenAlexW2284600470MaRDI QIDQ3457130FDOQ3457130

Authors: Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak 

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_29

Recommendations

• The cost of adaptivity in security games on graphs
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Be adaptive, avoid overcommitting
• Possibility and impossibility results for selective decommitments
• Adaptive Security of Constrained PRFs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Encryption schemes secure against chosen-ciphertext selective opening attacks
• Cryptographic agility and its relation to circular encryption
• Constrained pseudorandom functions and their applications
• Functional signatures and pseudorandom functions
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption

Cited In (8)

• The power of undirected rewindings for adaptive security
• Bounded Collusion ABE for TMs from IBE
• Compact NIZKs from standard assumptions on bilinear maps
• Adaptive security of Yao's garbled circuits
• Compact NIZKs from standard assumptions on bilinear maps
• Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
• The cost of adaptivity in security games on graphs
• Security analysis and improvements for the IETF MLS standard for group messaging

This page was built for publication: A quasipolynomial reduction for generalized selective decryption on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457130)