A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
From MaRDI portal
Publication:3457130
DOI10.1007/978-3-662-47989-6_29zbMath1375.94125OpenAlexW2284600470MaRDI QIDQ3457130
Krzysztof Pietrzak, Zahra Jafargholi, Georg Fuchsbauer
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
Related Items
Adaptive Security of Yao’s Garbled Circuits, Bounded Collusion ABE for TMs from IBE, Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin, The cost of adaptivity in security games on graphs, Compact NIZKs from standard assumptions on bilinear maps, Security analysis and improvements for the IETF MLS standard for group messaging
Cites Work
- Constrained Pseudorandom Functions and Their Applications
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
- Cryptographic Agility and Its Relation to Circular Encryption
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
- Tackling Adaptive Corruptions in Multicast Encryption Protocols
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Functional Signatures and Pseudorandom Functions