Chosen ciphertext security from injective trapdoor functions
From MaRDI portal
Publication:2096512
DOI10.1007/978-3-030-56784-2_28zbMATH Open1504.94146OpenAlexW3037443241MaRDI QIDQ2096512FDOQ2096512
Authors: Susan Hohenberger, Venkata Koppula, Brent Waters 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_28
Recommendations
Cites Work
- Probabilistic encryption
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Nonmalleable Cryptography
- IND-CCA secure cryptography based on a variant of the LPN problem
- Simple chosen-ciphertext security from low-noise LPN
- Title not available (Why is that?)
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Introduction to modern cryptography.
- Lossy trapdoor functions and their applications
- Chosen-ciphertext security from slightly lossy trapdoor functions
- Title not available (Why is that?)
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Trapdoor functions from the computational Diffie-Hellman assumption
- Title not available (Why is that?)
- Identity-based encryption from the Diffie-Hellman assumption
- Title not available (Why is that?)
- The twin Diffie-Hellman problem and applications
- Laconic oblivious transfer and its applications
- Advances in Cryptology - EUROCRYPT 2004
- Anonymous IBE, leakage resilience and circular security from new assumptions
- New constructions of identity-based and key-dependent message secure encryption schemes
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- From selective IBE to full IBE and selective HIBE
- Chosen-ciphertext security via correlated products
- New techniques for efficient trapdoor functions and applications
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- CPA-to-CCA transformation for KDM security
Cited In (18)
- Adaptive trapdoor functions and chosen-ciphertext security
- Power of randomness recovery: tighter CCA-secure KEM in the QROM
- Security with functional re-encryption from CPA
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- Targeted lossy functions and applications
- How to build a trapdoor function from an encryption scheme
- Randomness recoverable secret sharing schemes
- Injective rank metric trapdoor functions with homogeneous errors
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- CCA security and trapdoor functions via key-dependent-message security
- Quantum CCA-secure PKE, revisited
- Amortizing rate-1 OT and applications to PIR and PSI
- Chosen-Ciphertext Security via Correlated Products
- Cryptographic primitives with hinting property
- Chosen-ciphertext security via correlated products
- Preimage selective trapdoor function: how to repair an easy problem
This page was built for publication: Chosen ciphertext security from injective trapdoor functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096512)
