On constructing homomorphic encryption schemes from coding theory

DOI10.1007/978-3-642-25516-8_3MaRDI QIDQ3104683zbMATH OpenOpenAlexFDO

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

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

coding theoryefficiencyhomomorphic encryptionprovable security

Mathematics Subject Classification ID

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

Recommendations

• When Homomorphism Becomes a Liability
• Partially homomorphic encryption schemes over finite fields
• Fully homomorphic encryption using ideal lattices
• Applied homomorphic cryptography: examples
• Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes

Cites work

• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Additively homomorphic encryption with \(d\)-operand multiplications
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Algorithms for black-box fields and their application to cryptography
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• Circular-Secure Encryption from Decision Diffie-Hellman
• Detection and recognition of a binary linear code
• Faster fully homomorphic encryption
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Homomorphic Encryption with CCA Security
• Homomorphic signatures for polynomial functions
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 691465 (Why is no real title available?)
• scientific article; zbMATH DE number 2086625 (Why is no real title available?)
• Implementing Gentry's fully-homomorphic encryption scheme
• Multi-authority secret-ballot elections with linear work
• Oblivious Polynomial Evaluation
• On constructing homomorphic encryption schemes from coding theory
• Probabilistic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public-Key Cryptosystems Resilient to Key Leakage
• Receipt-free secret-ballot elections (extended abstract)
• Securing computation against continuous leakage
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• The arithmetic codex: theory and applications. (Abstract)

Cited in

(10)

• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Private set intersection: new generic constructions and feasibility results
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• On constructing homomorphic encryption schemes from coding theory
• scientific article; zbMATH DE number 1284427 (Why is no real title available?)
• Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
• Symmetric quantum fully homomorphic encryption with perfect security
• On the computational hardness of the code equivalence problem in cryptography
• Revisiting homomorphic encryption schemes for finite fields
• Somewhat homomorphic encryption based on random codes

This page was built for publication: On constructing homomorphic encryption schemes from coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104683)