Efficient completely non-malleable public key encryption
From MaRDI portal
Publication:3587374
Recommendations
- Completely Non-malleable Encryption Revisited
- Automata, Languages and Programming
- Lattice-based completely non-malleable public-key encryption in the standard model
- Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster)
- Strong Knowledge Extractors for Public-Key Encryption Schemes
Cited in
(21)- Incremental Deterministic Public-Key Encryption
- Non-malleable encryption: simpler, shorter, stronger
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
- An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism
- scientific article; zbMATH DE number 4057444 (Why is no real title available?)
- scientific article; zbMATH DE number 5056807 (Why is no real title available?)
- Theory of Cryptography
- From single-bit to multi-bit public-key encryption via non-malleable codes
- Completely Non-malleable Encryption Revisited
- New and improved constructions of non-malleable cryptographic protocols
- Nonmalleable Cryptography
- Lattice-based completely non-malleable public-key encryption in the standard model
- Dynamic and efficient joint encryption scheme in the plain public key model
- Efficient ZHFE Key Generation
- Public-Key Encryption with Efficient Amortized Updates
- On the complete non-malleability of the Fujisaki-Okamoto transform
- COA-secure obfuscation and applications
- Efficient completely non-malleable and RKA secure public key encryptions
- Reconciling non-malleability with homomorphic encryption
- Automata, Languages and Programming
- Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles
This page was built for publication: Efficient completely non-malleable public key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587374)
