Rerandomizable RCCA Encryption
From MaRDI portal
Publication:3612568
DOI10.1007/978-3-540-74143-5_29zbMath1215.94067OpenAlexW2100208807MaRDI QIDQ3612568
Mike Rosulek, Manoj Prabhakaran
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_29
Related Items (19)
Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ Generic plaintext equality and inequality proofs ⋮ Access Control Encryption: Enforcing Information Flow with Cryptography ⋮ Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE ⋮ Simplified Submission of Inputs to Protocols ⋮ Improving the efficiency of re-randomizable and replayable CCA secure public key encryption ⋮ Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Aggregatable distributed key generation ⋮ Revisiting (R)CCA security and replay protection ⋮ Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
This page was built for publication: Rerandomizable RCCA Encryption