Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

DOI10.1007/11818175_16zbMath1161.94424OpenAlexW1562872124MaRDI QIDQ5756655

Abhi Shelat, Vinod Vaikuntanathan, Rafael Pass

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_16

zbMATH Keywords

Non-malleabilityPublic-key EncryptionSemantic SecurityNon-interactive Zero-knowledge Proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

Multi-theorem designated-verifier NIZK for QMA ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Black-box non-interactive non-malleable commitments ⋮ Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

This page was built for publication: Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One