A black-box construction of non-malleable encryption from semantically secure encryption
type: Item
instance of: scholarly article
title: A black-box construction of non-malleable encryption from semantically secure encryption
zbMATH Open document ID: 1426.94091
author: Seung Geol Choi
author: Dana Dachman-Soled
author: Tal Malkin
author: Hoeteck Wee
published in: Journal of Cryptology
publication date: 2018-04-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6865037
zbMATH Keywords: public-key encryption
zbMATH Keywords: non-malleable encryption
zbMATH Keywords: black-box construction
MaRDI profile type: Publication
full work available at URL: s00145-017-9254-z
OpenAlex ID: W2596186875
Wikidata QID: Q121225270
cites work: Notions of Black-Box Reductions, Revisited
cites work: Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
cites work: Q4249337
cites work: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
cites work: Non-Malleable Encryption: Simpler, Shorter, Stronger
cites work: Non-malleable coding against bit-wise and split-state tampering
cites work: Bounded CCA2-Secure Encryption
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
cites work: Q4249317
cites work: Q4737235
cites work: A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme
cites work: Nonmalleable Cryptography
cites work: Computational Sample Complexity
cites work: Efficient robust private set intersection
cites work: Probabilistic encryption
cites work: Towards a Separation of Semantic and CCA Security for Public Key Encryption
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Foundations of Cryptography
cites work: Black-box non-black-box zero knowledge
cites work: Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
cites work: Practical Chosen Ciphertext Secure Encryption from Factoring
cites work: Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
cites work: Black-box constructions for secure computation
cites work: Q5750403
cites work: Round-Efficient Black-Box Construction of Composable Multi-Party Computation
cites work: Adaptive Trapdoor Functions and Chosen-Ciphertext Security
cites work: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
cites work: On the proof of correctness of a calendar program
cites work: A simpler construction of CCA2-secure public-key encryption under general assumptions
cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
cites work: Black-Box Constructions of Composable Protocols without Set-Up
cites work: Chosen Ciphertext Security via Point Obfuscation
cites work: The Notion of Security for Probabilistic Cryptosystems
cites work: Bit Encryption Is Complete
cites work: Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
cites work: Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
cites work: Lossy trapdoor functions and their applications
cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions
cites work: Q4035737
cites work: Chosen-Ciphertext Security via Correlated Products
cites work: Theory of Cryptography
cites work: Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
DOI: 10.1007/S00145-017-9254-Z
Recommended article: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Recommended article: Improved, black-box, non-malleable encryption from semantic security
Recommended article: Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Recommended article: Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
Recommended article: Black-box constructions for secure computation
Recommended article: Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
Recommended article: Black-Box Constructions of Protocols for Secure Computation
Recommended article: On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
Recommended article: Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
Recommended article: Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
description: scientific article; zbMATH DE number 6865037