Improving the efficiency of re-randomizable and replayable CCA secure public key encryption

DOI10.1007/978-3-030-57808-4_14OpenAlexW3082061684MaRDI QIDQ2229277

Antonio Faonio, Dario Fiore

Publication date: 23 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_14

zbMATH Keywords

re-randomizable replayable CCA

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (4)

Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ 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

Cites Work

• Updating key size estimations for pairings
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• An Algebraic Framework for Diffie-Hellman Assumptions
• Malleable Proof Systems and Applications
• Signatures on Randomizable Ciphertexts
• Rerandomizable RCCA Encryption
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Cryptology - CRYPTO 2003
• OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Topics in Cryptology – CT-RSA 2004
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the efficiency of re-randomizable and replayable CCA secure public key encryption