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

DOI10.1007/11818175_16MaRDI QIDQ5756655zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan

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-interactive Zero-knowledge ProofsNon-malleabilityPublic-key EncryptionSemantic Security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• A black-box construction of non-malleable encryption from semantically secure encryption
• Improved, black-box, non-malleable encryption from semantic security
• Nonmalleable Cryptography
• Nonmalleable Cryptography

Cited in

(20)

• Another step towards realizing random oracles: non-malleable point obfuscation
• A black-box construction of non-malleable encryption from semantically secure encryption
• 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
• Multi-theorem designated-verifier NIZK for QMA
• Dual-mode NIZKs: possibility and impossibility results for property transfer
• Non-malleable encryption: simpler, shorter, stronger
• Improved, black-box, non-malleable encryption from semantic security
• Non-malleable encryption: simpler, shorter, stronger
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Symmetric-key encryption scheme with multi-ciphertext non-malleability
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
• Multi-theorem preprocessing NIZKs from lattices
• Zero-knowledge arguments for subverted RSA groups
• A note on non-interactive zero-knowledge from CDH
• Security with functional re-encryption from CPA
• Fast public-key silent OT and more from constrained Naor-Reingold

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756655)