Efficient completely non-malleable and RKA secure public key encryptions
From MaRDI portal
Publication:2817809
Recommendations
Cites work
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1088257 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1759793 (Why is no real title available?)
- scientific article; zbMATH DE number 1878336 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Certificateless public key cryptography
- Completely Non-malleable Encryption Revisited
- Continuous non-malleable key derivation and its application to related-key security
- Cryptography secure against related-key attacks and tampering
- Efficient CCA-Secure PKE from Identity-Based Techniques
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Efficient completely non-malleable public key encryption
- Lattice-based completely non-malleable public-key encryption in the standard model
- Lossy trapdoor functions and their applications
- Nonmalleable Cryptography
- Public Key Encryption against Related Key Attacks
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Related key secure PKE from hash proof systems
- Related-key security for hybrid encryption
- Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
- Tamper detection and continuous non-malleable codes
- Theory of Cryptography
Cited in
(12)- Automata, Languages and Programming
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Non-malleable encryption: simpler, shorter, stronger
- scientific article; zbMATH DE number 1878332 (Why is no real title available?)
- New security notions and relations for public-key encryption
- Lattice-based completely non-malleable public-key encryption in the standard model
- Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Dynamic and efficient joint encryption scheme in the plain public key model
- Relations between robustness and RKA security under public-key encryption
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
- scientific article; zbMATH DE number 4057444 (Why is no real title available?)
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)