Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
More efficient (almost) tightly secure structure-preserving signatures
Kurosawa-Desmedt meets tight security
An efficient pairing-based shuffle argument
Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
Tight leakage-resilient CCA-security from quasi-adaptive hash proof system
Compactly Hiding Linear Spans
Tightly CCA-Secure Encryption Without Pairings
Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
An Algebraic Framework for Diffie-Hellman Assumptions
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
Malleable Proof Systems and Applications
Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
Disjunctions for Hash Proof Systems: New Constructions and Applications
Diffie-Hellman Oracles
The Uber-Assumption Family
Rerandomizable RCCA Encryption
Efficiency of a Good But Not Linear Set Union Algorithm
Adaptive Partitioning
Advances in Cryptology – CRYPTO 2004
Advances in Cryptology - CRYPTO 2003
Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
Cryptography and Coding
Theory of Cryptography
Mix-nets from re-randomizable and replayable CCA-secure public-key encryption

This page was built for publication: Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption