A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Semantic security for the McEliece cryptosystem without random oracles
- Efficient public key encryption with smallest ciphertext expansion from factoring
- The twin Diffie-Hellman problem and applications
- New approaches for deniable authentication
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- A black-box construction of non-malleable encryption from semantically secure encryption
- Reusable fuzzy extractor from the decisional Diffie-Hellman assumption
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Public key signatures in the multi-user setting.
- Secure integration of asymmetric and symmetric encryption schemes
- Deterministic public-key encryption for adaptively-chosen plaintext distributions
- Signcryption schemes with insider security in an ideal permutation model
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- CCA-security from adaptive all-but-one lossy trapdoor functions
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On the CCA compatibility of public-key infrastructure
- Identity-based encryption with security against the KGC: a formal model and its instantiations
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- A new cryptosystem based on a twisted Hessian curve \(H^4_{a,d}\)
- Chosen ciphertext security from injective trapdoor functions
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Towards witness encryption without multilinear maps
- SimS: a simplification of SiGamal
- Secure hybrid encryption in the standard model from hard learning problems
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Does Fiat-Shamir require a cryptographic hash function?
- Generic plaintext equality and inequality proofs
- Tightness subtleties for multi-user PKE notions
- An efficient post-quantum KEM from CSIDH
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- General linear group action on tensors: a candidate for post-quantum cryptography
- On the Menezes-Teske-Weng conjecture
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Non-malleable encryption: simpler, shorter, stronger
- Continuously non-malleable codes in the split-state model
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
- Efficient hybrid encryption from ID-based encryption
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Naor-Yung paradigm with shared randomness and applications
- Reconciling non-malleability with homomorphic encryption
- Simulation-based selective opening security for receivers under chosen-ciphertext attacks
- In search of mathematical primitives for deriving universal projective hash families
- Lattice-based completely non-malleable public-key encryption in the standard model
- All-in-one group-oriented cryptosystem based on bilinear pairing
- Tag-KEM/DEM: A new framework for hybrid encryption
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
- Authentication schemes with no verification table
- A public key cryptosystem based on a subgroup membership problem
- Multi-use and unidirectional identity-based proxy re-encryption schemes
- Efficient chameleon hash functions in the enhanced collision resistant model
- Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing
- A new framework for deniable secure key exchange
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
- Cryptographic shallots: a formal treatment of repliable onion encryption
- On the impossibility of purely algebraic signatures
- A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
- Non-malleability under selective opening attacks: implication and separation
- Non-malleable encryption: simpler, shorter, stronger
- Secure ElGamal-type cryptosystems without message encoding
- Identity-based group encryption
- Naor-Yung Paradigm with Shared Randomness and Applications
- Provably-secure remote memory attestation for heap overflow protection
- Improving practical UC-secure commitments based on the DDH assumption
- Fully secure functional encryption for inner products, from standard assumptions
- On CCA-Secure Somewhat Homomorphic Encryption
- Deniable Encryptions Secure against Adaptive Chosen Ciphertext Attack
- A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
- Structure-preserving smooth projective hashing
- Iterated random oracle: a universal approach for finding loss in security reduction
- Towards certificate-based group encryption
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Encoding-free ElGamal-type encryption schemes on elliptic curves
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- How to make the Cramer-Shoup cryptosystem secure against linear related-key attacks
- Leakage-resilient IND-CCA KEM from the extractable hash proofs with indistinguishability obfuscation
- Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
- Lossy key encapsulation mechanism and its applications
- New realizations of efficient and secure private set intersection protocols preserving fairness
- Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
- Tightly secure signatures and public-key encryption
- Identification schemes from key encapsulation mechanisms
- Adaptively secure non-interactive threshold cryptosystems
- Toward compact public key encryption based on CDH assumption via extended twin DH assumption
- A public key cryptoscheme using bit-pairs with provable semantical security
- Compact E-Cash and Simulatable VRFs Revisited
- Public-key encryption schemes with auxiliary inputs
- A practical approach to attaining chosen ciphertext security
- A semantically secure public key cryptoscheme using bit-pair shadows
- Simpler CCA-secure public key encryption from lossy trapdoor functions
- Trapdoor Permutation Polynomials of ℤ/nℤ and Public Key Cryptosystems
This page was built for publication: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249317)
