Key-dependent message security: generic amplification and completeness
type: Item
instance of: scholarly article
title: Key-dependent message security: generic amplification and completeness
zbMATH Open document ID: 1302.94033
author: Benny Applebaum
published in: Journal of Cryptology
publication date: 2014-09-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6347557
zbMATH Keywords: key-dependent message
zbMATH Keywords: cyclic-security
zbMATH Keywords: randomized encoding
zbMATH Keywords: garbled circuits
MaRDI profile type: Publication
full work available at URL: s00145-013-9149-6
OpenAlex ID: W2082117735
cites work: Q4536407
cites work: Cryptographic Agility and Its Relation to Circular Encryption
cites work: Computationally private randomizing polynomials and their applications
cites work: Cryptography in $NC^0$
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: OAEP Is Secure under Key-Dependent Messages
cites work: Bounded Key-Dependent Message Security
cites work: On arithmetic branching programs
cites work: Q4413854
cites work: Circular-Secure Encryption from Decision Diffie-Hellman
cites work: Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Black-Box Circular-Secure Encryption beyond Affine Functions
cites work: Q2778843
cites work: A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
cites work: Q4434901
cites work: Q3325625
cites work: Fully homomorphic encryption using ideal lattices
cites work: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
cites work: Foundations of Cryptography
cites work: Probabilistic encryption
cites work: On the (Im)Possibility of Key Dependent Encryption
cites work: Towards Key-Dependent Message Security in the Standard Model
cites work: Q5750403
cites work: Q4737161
cites work: Q4035737
cites work: Computing Blindfolded: New Developments in Fully Homomorphic Encryption
DOI: 10.1007/S00145-013-9149-6
description: scientific article; zbMATH DE number 6347557