scientific article

Publication date: 18 May 1993

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

chosen ciphertext attacks public key systems El Gamal/Diffie-Hellman public key system sufficient identification schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On CCA-Secure Somewhat Homomorphic Encryption, A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials, Master-Key KDM-Secure IBE from Pairings, Toward RSA-OAEP Without Random Oracles, On QA-NIZK in the BPK Model, Signatures of Knowledge for Boolean Circuits Under Standard Assumptions, Succinct non-interactive arguments via linear interactive proofs, Composition with knowledge assumptions, Signatures of knowledge for Boolean circuits under standard assumptions, Generic plaintext equality and inequality proofs, Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption, On characterizations of escrow encryption schemes, Compact and Efficient UC Commitments Under Atomic-Exchanges, On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption, A new framework for deniable secure key exchange, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, A Shuffle Argument Secure in the Generic Model, A short non-delegatable strong designated verifier signature, A Brief History of Provably-Secure Public-Key Encryption, Succinct NP Proofs from an Extractability Assumption, MyOPE: malicious security for oblivious polynomial evaluation, Another round of breaking and making quantum money: how to not build it from lattices, and more, Individual cryptography, Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG, Relationship between Two Approaches for Defining the Standard Model PA-ness, Updatable NIZKs from non-interactive zaps, Better than advertised security for non-interactive threshold signatures, CRS-updatable asymmetric quasi-adaptive NIZK arguments, Group homomorphic encryption: characterizations, impossibility results, and applications, The hunting of the SNARK, Impossibilities in succinct arguments: black-box extraction and more, Efficient traceable signatures in the standard model, Secure integration of asymmetric and symmetric encryption schemes, On the adaptive security of MACs and PRFs, Practical dynamic group signatures without knowledge extractors, Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions, Security models and proof strategies for plaintext-aware encryption, On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups, Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption, Random walks and concurrent zero-knowledge, Strongly secure authenticated key exchange from factoring, codes, and lattices, Magic Adversaries Versus Individual Reduction: Science Wins Either Way, Automated proofs for asymmetric encryption, Lower bounds for non-black-box zero knowledge, Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks, The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model, Automated Proofs for Asymmetric Encryption, Cryptographic Assumptions: A Position Paper, On subversion-resistant SNARKs, A New Randomness Extraction Paradigm for Hybrid Encryption, Boosting verifiable computation on encrypted data, Linearly-homomorphic signatures and scalable mix-nets, Efficient Traceable Signatures in the Standard Model, On the Existence of Extractable One-Way Functions, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, On the Necessary and Sufficient Assumptions for UC Computation, Hybrid Damgård Is CCA1-Secure under the DDH Assumption, Type-Based Proxy Re-encryption and Its Construction, A CCA Secure Hybrid Damgård’s ElGamal Encryption, An Efficient Self-blindable Attribute-Based Credential Scheme, Towards witness encryption without multilinear maps, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, Generic transformation from broadcast encryption to round-optimal deniable ring authentication, SimS: a simplification of SiGamal, On instantiating the algebraic group model from falsifiable assumptions