Efficient completely non-malleable and RKA secure public key encryptions

DOI10.1007/978-3-319-40367-0_9zbMATH Open1346.94126OpenAlexW2493246378MaRDI QIDQ2817809FDOQ2817809

Authors: Shi-Feng Sun, Udaya Parampalli, Tsz Hon Yuen, Yu Yu, Dawu Gu 

Publication date: 2 September 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40367-0_9

Recommendations

• Public Key Encryption against Related Key Attacks
• Efficient completely non-malleable public key encryption
• Automata, Languages and Programming
• New security notions and relations for public-key encryption
• Relations between robustness and RKA security under public-key encryption

zbMATH Keywords

related-key attackpublic key encryptionchosen-ciphertext attackcomplete non-malleability

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Public Key Encryption against Related Key Attacks
• Cryptography secure against related-key attacks and tampering
• Title not available (Why is that?)
• Title not available (Why is that?)
• RKA security beyond the linear barrier: IBE, encryption and signatures
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Certificateless public key cryptography
• Nonmalleable Cryptography
• Theory of Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lossy trapdoor functions and their applications
• Advances in Cryptology - EUROCRYPT 2004
• Title not available (Why is that?)
• Efficient CCA-Secure PKE from Identity-Based Techniques
• Continuous non-malleable key derivation and its application to related-key security
• Tamper detection and continuous non-malleable codes
• Efficient completely non-malleable public key encryption
• Related-key security for hybrid encryption
• Related key secure PKE from hash proof systems
• Lattice-based completely non-malleable public-key encryption in the standard model
• Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
• Completely Non-malleable Encryption Revisited
• Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles

Cited In (12)

• Non-malleable encryption: simpler, shorter, stronger
• Relations between robustness and RKA security under public-key encryption
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Title not available (Why is that?)
• Lattice-based completely non-malleable public-key encryption in the standard model
• Dynamic and efficient joint encryption scheme in the plain public key model
• New security notions and relations for public-key encryption
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Title not available (Why is that?)
• Automata, Languages and Programming
• Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
• Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions

This page was built for publication: Efficient completely non-malleable and RKA secure public key encryptions

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