Completely Non-malleable Encryption Revisited
From MaRDI portal
Recommendations
- Efficient completely non-malleable public key encryption
- Completely non-malleable schemes (extended abstract)
- Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
- Non-malleable encryption: simpler, shorter, stronger
- Lattice-based completely non-malleable public-key encryption in the standard model
Cites work
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- Advances in Cryptology - EUROCRYPT 2004
- Completely non-malleable schemes (extended abstract)
- Efficient and non-malleable proofs of plaintext knowledge and applications
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- New and improved constructions of non-malleable cryptographic protocols
- Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization
- Optimal asymmetric encryption
- Relations among notions of security for public-key encryption schemes
- Robust non-interactive zero knowledge
- RSA-OAEP is secure under the RSA assumption
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
Cited in
(19)- COA-secure obfuscation and applications
- Non-malleable encryption: simpler, shorter, stronger
- Lattice-based completely non-malleable public-key encryption in the standard model
- Non-malleable encryption: simpler, shorter, stronger
- Efficient completely non-malleable and RKA secure public key encryptions
- Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
- Encryption Simulatability Reconsidered
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
- Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
- New and improved constructions of non-malleable cryptographic protocols
- Efficient completely non-malleable public key encryption
- Cascade Encryption Revisited
- Nonmalleable Cryptography
- The security of all-or-nothing encryption: Protecting against exhaustive key search
- Bit Encryption Is Complete
- Completely non-malleable schemes (extended abstract)
- Fine-grained cryptography revisited
- Fine-grained cryptography revisited
- On the complete non-malleability of the Fujisaki-Okamoto transform
This page was built for publication: Completely Non-malleable Encryption Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445447)