Rerandomizable RCCA Encryption

DOI10.1007/978-3-540-74143-5_29MaRDI QIDQ3612568zbMATH OpenOpenAlexFDO

Authors Manoj Prabhakaran, Mike Rosulek

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
• Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
• 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
• Randomized coding of plaintext encryption scheme
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Related randomness security for public key encryption, revisited
• Theory of Cryptography
• Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved

Cited in

(33)

• Natural sd-RCCA secure public-key encryptions
• Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Aggregatable distributed key generation
• Revisiting (R)CCA security and replay protection
• Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
• Generic plaintext equality and inequality proofs
• CCA secure \textit{a posteriori} openable encryption in the standard model
• 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
• Reconciling non-malleability with homomorphic encryption
• Hardware security without secure hardware: how to decrypt with a password and a server
• Message transmission with reverse firewalls -- secure communication on corrupted machines
• Augmented Learning with Errors: The Untapped Potential of the Error Term
• Access control encryption: enforcing information flow with cryptography
• Simplified Submission of Inputs to Protocols
• Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Chosen ciphertext secure keyed-homomorphic public-key encryption
• Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
• Efficient Encryption From Random Quasi-Cyclic Codes
• Practical dual-receiver encryption. Soundness, complete non-malleability, and applications
• Advances in Cryptology - CRYPTO 2003
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Theory of Cryptography
• 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
• Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions
• Sender-anamorphic encryption reformulated: achieving robust and generic constructions
• Malleable SNARKs and their applications
• SAVER: SNARK-compatible verifiable encryption
• Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited

This page was built for publication: Rerandomizable RCCA Encryption

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