Group homomorphic encryption: characterizations, impossibility results, and applications

DOI10.1007/s10623-011-9601-2zbMath1305.94034OpenAlexW2168532569WikidataQ120968549 ScholiaQ120968549MaRDI QIDQ1943979

Andreas Peter, Frederik Armknecht, Stefan Katzenbeisser

Publication date: 3 April 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9601-2

zbMATH Keywords

foundationspublic-key cryptographyhomomorphic encryptionsubgroup membership problemIND-CCA1 security\(k\)-linear problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Analysis of Gong et al.'s CCA2-secure homomorphic encryption ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Unsupervised Machine Learning on encrypted data ⋮ Accelerating Homomorphic Computations on Rational Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• The theory of finite groups. An introduction.
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• Receipt-free secret-ballot elections (extended abstract)
• Multi-Authority Secret-Ballot Elections with Linear Work
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• On the CCA1-Security of Elgamal and Damgård’s Elgamal
• Homomorphic Encryption with CCA Security
• Lossy trapdoor functions and their applications
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Oblivious Polynomial Evaluation
• Progress in Cryptology – Mycrypt 2005
• Public Key Cryptography - PKC 2005
• Theory of Cryptography
• Non-interactive Zaps and New Techniques for NIZK
• Public-Key Cryptosystems Resilient to Key Leakage
• Cryptography and Coding
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: Group homomorphic encryption: characterizations, impossibility results, and applications