A black-box construction of non-malleable encryption from semantically secure encryption

DOI10.1007/s00145-017-9254-zzbMath1426.94091OpenAlexW2596186875WikidataQ121225270 ScholiaQ121225270MaRDI QIDQ1747662

Hoeteck Wee, Dana Dachman-Soled, Tal Malkin, Seung Geol Choi

Publication date: 26 April 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-017-9254-z

zbMATH Keywords

public-key encryptionblack-box constructionnon-malleable encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

ZK-PCPs from leakage-resilient secret sharing ⋮ Round-efficient black-box construction of composable multi-party computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable coding against bit-wise and split-state tampering
• A simpler construction of CCA2-secure public-key encryption under general assumptions
• Probabilistic encryption
• Efficient robust private set intersection
• Non-Malleable Encryption: Simpler, Shorter, Stronger
• Notions of Black-Box Reductions, Revisited
• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
• Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
• Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
• Black-Box Constructions of Composable Protocols without Set-Up
• Black-box constructions for secure computation
• Bounded CCA2-Secure Encryption
• Lossy trapdoor functions and their applications
• Adaptive Trapdoor Functions and Chosen-Ciphertext Security
• Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Chosen-Ciphertext Security via Correlated Products
• Practical Chosen Ciphertext Secure Encryption from Factoring
• The Notion of Security for Probabilistic Cryptosystems
• The Knowledge Complexity of Interactive Proof Systems
• On the proof of correctness of a calendar program
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Nonmalleable Cryptography
• Foundations of Cryptography
• Computational Sample Complexity
• Bit Encryption Is Complete
• Black-box non-black-box zero knowledge
• From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
• Chosen Ciphertext Security via Point Obfuscation
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Theory of Cryptography

This page was built for publication: A black-box construction of non-malleable encryption from semantically secure encryption