Group homomorphic encryption: characterizations, impossibility results, and applications
type: Item
instance of: scholarly article
title: Group homomorphic encryption: characterizations, impossibility results, and applications
zbMATH Open document ID: 1305.94034
author: Frederik Armknecht
author: Stefan Katzenbeisser
author: Andreas Peter
published in: Designs, Codes and Cryptography
publication date: 2013-04-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6150031
zbMATH Keywords: foundations
zbMATH Keywords: homomorphic encryption
zbMATH Keywords: public-key cryptography
zbMATH Keywords: IND-CCA1 security
zbMATH Keywords: subgroup membership problem
zbMATH Keywords: \(k\)-linear problem
Wikidata QID: Q120968549
MaRDI profile type: Publication
full work available at URL: s10623-011-9601-2
OpenAlex ID: W2168532569
cites work: Q4249318
cites work: Receipt-free secret-ballot elections (extended abstract)
cites work: Q4432349
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Theory of Cryptography
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q3840086
cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption
cites work: Q4737235
cites work: Multi-Authority Secret-Ballot Elections with Linear Work
cites work: Q3149671
cites work: Q4035738
cites work: Q2724587
cites work: Q4314356
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Fully homomorphic encryption using ideal lattices
cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme
cites work: Progress in Cryptology – Mycrypt 2005
cites work: Public Key Cryptography - PKC 2005
cites work: Topics in Cryptology – CT-RSA 2006
cites work: Probabilistic encryption
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: Secure Hybrid Encryption from Weakened Key Encapsulation
cites work: Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
cites work: The theory of finite groups. An introduction.
cites work: Q2770573
cites work: On the CCA1-Security of Elgamal and Damgård’s Elgamal
cites work: Cryptography and Coding
cites work: Oblivious Polynomial Evaluation
cites work: Public-Key Cryptosystems Resilient to Key Leakage
cites work: Q4249647
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Lossy trapdoor functions and their applications
cites work: Homomorphic Encryption with CCA Security
cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
cites work: Fully Homomorphic Encryption over the Integers
DOI: 10.1007/S10623-011-9601-2
description: scientific article; zbMATH DE number 6150031