Non-malleable encryption: simpler, shorter, stronger
From MaRDI portal
Publication:2210445
Recommendations
- Non-malleable encryption: simpler, shorter, stronger
- Completely Non-malleable Encryption Revisited
- Efficient completely non-malleable public key encryption
- Nonmalleable Cryptography
- Nonmalleable Cryptography
- Symmetric-key encryption scheme with multi-ciphertext non-malleability
- Efficient completely non-malleable and RKA secure public key encryptions
- Reconciling non-malleability with homomorphic encryption
- New and improved constructions of non-malleable cryptographic protocols
- scientific article; zbMATH DE number 1418315
Cites work
- A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
- A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Amplification of Chosen-Ciphertext Security
- Bit Encryption Is Complete
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
- Block-wise non-malleable codes
- Bounded CCA2-Secure Encryption
- Capacity of non-malleable codes
- Chosen-ciphertext security via correlated products
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Continuous non-malleable codes
- Continuous non-malleable codes in the 8-split-state model
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Continuously non-malleable codes with split-state refresh
- Detecting dangerous queries: a new approach for chosen ciphertext security
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Explicit non-malleable codes against bit-wise tampering and permutations
- Four-state non-malleable codes with explicit constant rate
- From single-bit to multi-bit public-key encryption via non-malleable codes
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2009959 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- scientific article; zbMATH DE number 1418315 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Improved, black-box, non-malleable encryption from semantic security
- Inception makes non-malleable codes stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Leakage-resilient non-malleable codes
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Lossy Trapdoor Functions and Their Applications
- New directions in cryptography
- Non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Non-malleable codes for decision trees
- Non-malleable codes for space-bounded tampering
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable codes from two-source extractors
- Non-malleable encryption: simpler, shorter, stronger
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable reductions and applications
- Nonmalleable Cryptography
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Probabilistic encryption
- Rate-optimizing compilers for continuously non-malleable codes
- Relations Among Notions of Non-malleability for Encryption
- Some (in)sufficient conditions for secure hybrid encryption
- Tamper and Leakage Resilience in the Split-State Model
- Tamper detection and continuous non-malleable codes
- Theory of Cryptography
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Upper and lower bounds for continuous non-malleable codes
Cited in
(3)
This page was built for publication: Non-malleable encryption: simpler, shorter, stronger
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210445)
