Towards practical public key systems secure against chosen ciphertext attacks

Recommendations

scientific article; zbMATH DE number 708812
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Securing threshold cryptosystems against chosen ciphertext attack
Chosen-ciphertext security for any one-way cryptosystem

Cited in

(only showing first 100 items - show all)

Attacks and counter-attacks on the GPT public key cryptosystem
The hunting of the SNARK
Group homomorphic encryption: characterizations, impossibility results, and applications
Secure integration of asymmetric and symmetric encryption schemes
On subversion-resistant SNARKs
Boosting verifiable computation on encrypted data
Linearly-homomorphic signatures and scalable mix-nets
Towards witness encryption without multilinear maps
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
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
Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
Random walks and concurrent zero-knowledge
Security models and proof strategies for plaintext-aware encryption
Lower bounds for non-black-box zero knowledge
A new framework for deniable secure key exchange
On the adaptive security of MACs and PRFs
Practical dynamic group signatures without knowledge extractors
On the power of misbehaving adversaries and security analysis of the original EPOC
Cryptographic assumptions: a position paper
On the existence of extractable one-way functions
Fully secure functional encryption for inner products, from standard assumptions
On CCA-Secure Somewhat Homomorphic Encryption
Compact and efficient UC commitments under atomic-exchanges
On constant-round concurrent zero-knowledge from a knowledge assumption
NIZKs with an untrusted CRS: security in the face of parameter subversion
A shuffle argument secure in the generic model
Achieving Chosen Ciphertext Security from Detectable Public Key Encryption Efficiently via Hybrid Encryption
Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
scientific article; zbMATH DE number 4172375 (Why is no real title available?)
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Using hash functions as a hedge against chosen ciphertext attack
Efficient Traceable Signatures in the Standard Model
On the necessary and sufficient assumptions for UC computation
scientific article; zbMATH DE number 5140763 (Why is no real title available?)
Public Key Encryption and Encryption Emulation Attacks
A Brief History of Provably-Secure Public-Key Encryption
Succinct NP Proofs from an Extractability Assumption
Relationship between Two Approaches for Defining the Standard Model PA-ness
Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
A New Randomness Extraction Paradigm for Hybrid Encryption
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
scientific article; zbMATH DE number 708812 (Why is no real title available?)
Another method for attaining security against adaptively chosen ciphertext attacks
Cryptanalysis of the immunized LL public key systems
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack
scientific article; zbMATH DE number 1962154 (Why is no real title available?)
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Efficient public-key cryptosystems provably secure against active adversaries
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
On characterizations of escrow encryption schemes
Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
Strongly secure authenticated key exchange from factoring, codes, and lattices
Key variation technique based on piggybacking strategies under public key environments
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
On the classification of knowledge-of-exponent assumptions in cyclic groups
Automated proofs for asymmetric encryption
Lattice-based SNARGs and their application to more efficient obfuscation
Automated proofs for asymmetric encryption
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
Magic adversaries versus individual reduction: science wins either way
scientific article; zbMATH DE number 4187095 (Why is no real title available?)
An efficient self-blindable attribute-based credential scheme
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
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
Updatable NIZKs from non-interactive zaps
Better than advertised security for non-interactive threshold signatures
CRS-updatable asymmetric quasi-adaptive NIZK arguments
Impossibilities in succinct arguments: black-box extraction and more
Efficient traceable signatures in the standard model
Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
Algebraic group model with oblivious sampling
\textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity
Benchmarking the setup of updatable zk-SNARKs
Generating supersingular elliptic curves over \(\mathbb{F}_p\) with unknown endomorphism ring
Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
Updatable public-key encryption, revisited
On deniable authentication against malicious verifiers
Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
Sherlock Holmes zero-knowledge protocols secure against active attackers
Quantum money from abelian group actions
Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
New limits for homomorphic encryption
Single-round proofs of quantumness from knowledge assumptions

This page was built for publication: Towards practical public key systems secure against chosen ciphertext attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035738)