On Constructing Homomorphic Encryption Schemes from Coding Theory

DOI10.1007/978-3-642-25516-8_3zbMath1281.94011OpenAlexW118080808MaRDI QIDQ3104683

Frederik Armknecht, Ahmad-Reza Sadeghi, Daniel Augot, Ludovic Perret

Publication date: 16 December 2011

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_3

zbMATH Keywords

efficiencycoding theoryprovable securityhomomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Coding theorems (Shannon theory) (94A24)

Related Items

Private set intersection: new generic constructions and feasibility results, Symmetric quantum fully homomorphic encryption with perfect security, On Constructing Homomorphic Encryption Schemes from Coding Theory

Cites Work

• Probabilistic encryption
• Receipt-free secret-ballot elections (extended abstract)
• Multi-Authority Secret-Ballot Elections with Linear Work
• The Arithmetic Codex: Theory and Applications
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Homomorphic Signatures for Polynomial Functions
• Faster Fully Homomorphic Encryption
• On Constructing Homomorphic Encryption Schemes from Coding Theory
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• Algorithms for Black-Box Fields and their Application to Cryptography
• Homomorphic Encryption with CCA Security
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Securing Computation against Continuous Leakage
• Additively Homomorphic Encryption with d-Operand Multiplications
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Circular-Secure Encryption from Decision Diffie-Hellman
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• Oblivious Polynomial Evaluation
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Public-Key Cryptosystems Resilient to Key Leakage
• Detection and recognition of a binary linear code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item