Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack

Recommendations

Non-interactive zero-knowledge proofs with fine-grained security
Theory of Cryptography
New technique for chosen-ciphertext security based on non-interactive zero-knowledge
scientific article; zbMATH DE number 4053065
scientific article; zbMATH DE number 4197461
Non-interactive zero-knowledge proofs to multiple verifiers
Noninteractive Zero-Knowledge
Pairing-based non-interactive zero-knowledge proofs
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
Theory of Cryptography

Cited in

(only showing first 100 items - show all)

Efficient public key encryption with smallest ciphertext expansion from factoring
Authenticated encryption: relations among notions and analysis of the generic composition paradigm
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
Shorter quasi-adaptive NIZK proofs for linear subspaces
A black-box construction of non-malleable encryption from semantically secure encryption
Robust encryption
Zero-knowledge arguments and public-key cryptography
Practical chosen ciphertext secure encryption from factoring
Secure integration of asymmetric and symmetric encryption schemes
Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
On the CCA compatibility of public-key infrastructure
A new cryptosystem based on a twisted Hessian curve $H^4_{a,d}$
Chosen ciphertext security from injective trapdoor functions
A performance evaluation of pairing-based broadcast encryption systems
Practical algorithm substitution attack on extractable signatures
COA-secure obfuscation and applications
Multi-designated receiver signed public key encryption
Anonymity of NIST PQC round 3 KEMs
CPA-to-CCA transformation for KDM security
Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
New technique for chosen-ciphertext security based on non-interactive zero-knowledge
Obfuscation for cryptographic purposes
A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
Efficient hybrid encryption from ID-based encryption
Signcryption from randomness recoverable public key encryption
How to construct secure proxy cryptosystem
Naor-Yung paradigm with shared randomness and applications
Reconciling non-malleability with homomorphic encryption
Instantiability of RSA-OAEP under chosen-plaintext attack
Universally composable symbolic security analysis
Security models and proof strategies for plaintext-aware encryption
Tag-KEM/DEM: A new framework for hybrid encryption
Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
Security analysis and improvement of a double-trapdoor encryption scheme
A public key cryptosystem based on a subgroup membership problem
An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
Cryptographic algorithms for privacy-preserving online applications
Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
Non-malleability under selective opening attacks: implication and separation
CCA-secure keyed-fully homomorphic encryption
Secure ElGamal-type cryptosystems without message encoding
Adaptive hardness and composable security in the plain model from standard assumptions
Naor-Yung Paradigm with Shared Randomness and Applications
Improving practical UC-secure commitments based on the DDH assumption
Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
Signature schemes secure against hard-to-invert leakage
Structure-preserving smooth projective hashing
Achieving IND-CCA Security for Functional Encryption for Inner Products
Tightly secure signatures and public-key encryption
Efficient threshold encryption from lossy trapdoor functions
Sponge based CCA2 secure asymmetric encryption for arbitrary length message
scientific article; zbMATH DE number 4172375 (Why is no real title available?)
scientific article; zbMATH DE number 4191103 (Why is no real title available?)
Compact E-Cash and Simulatable VRFs Revisited
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
Robust Encryption
A practical approach to attaining chosen ciphertext security
Simpler CCA-secure public key encryption from lossy trapdoor functions
Formal Security Treatments for Signatures from Identity-Based Encryption
A Brief History of Provably-Secure Public-Key Encryption
Traceable Privacy of Recent Provably-Secure RFID Protocols
Anonymous Proxy Signatures
Simplified Submission of Inputs to Protocols
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
OAEP Is Secure under Key-Dependent Messages
An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
Practical Chosen Ciphertext Secure Encryption from Factoring
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
A New Randomness Extraction Paradigm for Hybrid Encryption
Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures
On the Theoretical Gap between Group Signatures with and without Unlinkability
scientific article; zbMATH DE number 4053065 (Why is no real title available?)
Parallel repetition of computationally sound protocols revisited
Discrete logarithm based additively homomorphic encryption and secure data aggregation
scientific article; zbMATH DE number 2009957 (Why is no real title available?)
Nonmalleable Cryptography
Lossy trapdoor functions from homomorphic reproducible encryption
On characterizations of escrow encryption schemes
Optimistic fair exchange in the enhanced chosen-key model
scientific article; zbMATH DE number 1842511 (Why is no real title available?)
Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
Key encapsulation mechanisms from extractable hash proof systems, revisited
Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
Provably secure Rabin-p cryptosystem in hybrid setting
Toward RSA-OAEP without random oracles
Group-Based Source-Destination Verifiable Encryption with Blacklist Checking
Compact Lossy and All-but-One Trapdoor Functions from Lattice
A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
Traceable PRFs: full collusion resistance and active security
Delegation of cryptographic servers for capture-resilient devices
The geometry of provable security: some proofs of security in which lattices make a surprise appearance
On the Impossibility of Strong Encryption Over $\aleph_0$

This page was built for publication: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack

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