Chosen ciphertext security via BARGs
From MaRDI portal
Cites work
- A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
- A Pseudorandom Generator from any One-way Function
- Adaptive trapdoor functions and chosen-ciphertext security
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Batch arguments to NIZKs from one-way functions
- Bit commitment using pseudorandomness
- Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
- Boosting batch arguments and RAM delegation
- CCA security and trapdoor functions via key-dependent-message security
- Chosen ciphertext security from injective trapdoor functions
- Chosen ciphertext security via point obfuscation
- Chosen ciphertext security via UCE
- Chosen-ciphertext security from slightly lossy trapdoor functions
- Chosen-Ciphertext Security via Correlated Products
- Circular security is complete for KDM security
- Constructing and understanding chosen ciphertext security via puncturable key encapsulation mechanisms
- CPA-to-CCA transformation for KDM security
- Efficient chosen-ciphertext security via extractable hash proofs
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Instantiating random oracles via UCEs
- Lossy trapdoor functions and their applications
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive zero-knowledge from non-interactive batch arguments
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Reproducible circularly-secure bit encryption: applications and realizations
- Separating succinct non-interactive arguments from all falsifiable assumptions
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Theory of Cryptography
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
This page was built for publication: Chosen ciphertext security via BARGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951319)
