scientific article; zbMATH DE number 1341866

Publication date: 22 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

hash function random oracle model adaptive chosen-ciphertext attacks active adversaries non-malleable public-key encryption semantically secure public-key encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (48)

A more efficient accountable authority IBE scheme under the DL assumption ⋮ The KDM-CCA Security of REACT ⋮ An Efficient and Provably Secure Certificate-Based Encryption Scheme ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ On the Impossibility of Strong Encryption Over $\aleph_0$ ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Anonymous, robust post-quantum public key encryption ⋮ Online-extractability in the quantum random-oracle model ⋮ Modular Design of Role-Symmetric Authenticated Key Exchange Protocols ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ On optimizing electricity markets performance ⋮ An injectivity analysis of Crystals-Kyber and implications on quantum security ⋮ Attribute-Based Broadcast Encryption Scheme Made Efficient ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Relationship between Two Approaches for Defining the Standard Model PA-ness ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Lattice-based cryptography: a survey ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ An efficient IND-CCA2 secure Paillier-based cryptosystem ⋮ A note on an IND-CCA2 secure paillier-based cryptosystem ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications ⋮ Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ Computational friendly attribute-based encryptions with short ciphertext ⋮ New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem ⋮ New designing of cryptosystems based on quadratic fields ⋮ Automated Proofs for Asymmetric Encryption ⋮ Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities ⋮ A provably secure certificate-based encryption scheme against malicious CA attacks in the standard model ⋮ An efficient and secure navigation protocol based on vehicular cloud ⋮ Strongly Secure Certificateless Public Key Encryption Without Pairing ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ Verifiable Security of Boneh-Franklin Identity-Based Encryption ⋮ Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem ⋮ A public key cryptosystem based on a subgroup membership problem ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ A performance evaluation of pairing-based broadcast encryption systems ⋮ Revocable hierarchical identity-based authenticated key exchange ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication

This page was built for publication: