On Constructing Homomorphic Encryption Schemes from Coding Theory-Reference-Cited by-同舟云学术

On Constructing Homomorphic Encryption Schemes from Coding Theory

Published:2011 Issue: Volume: Page:23-40
ISSN:0302-9743
Container-title:Cryptography and Coding
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25516-8_3

Reference42 articles.

1. Armknecht, F., Augot, D., Perret, L., Sadeghi, A.-R.: On constructing homomorphic encryption schemes from coding theory. Eprint Report, 309 (2011)

2. Armknecht, F., Peter, A., Katzenbeisser, S.: A cleaner view on IND-CCA1 secure homomorphic encryption using SOAP. Cryptology ePrint Archive, Report 2010/501 (2010), http://eprint.iacr.org/

3. Avanzi, R.: Lightweight asymmetric cryptography and alternatives to RSA, ecrypt european network of excellence in cryptology ist-2002-507932 (2005), http://www.ecrypt.eu.org/ecrypt1/documents/D.AZTEC.2-1.2.pdf

4. Benaloh, J.: Verifiable secret-ballot elections. PhD thesis, Yale University, New Haven, CT, USA (1987)

5. Lecture Notes in Computer Science;D. Boneh,1996

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Elliptic code-based oblivious polynomial evaluation;Computer Standards & Interfaces;2024-08

2. Oblivious Polynomial Evaluation from Elliptic Code-based Symmetric Homomorphic Encryption;2023 International Conference on Data Security and Privacy Protection (DSPP);2023-10-16

3. A Modified Symmetric Key Fully Homomorphic Encryption Scheme Based on Read-Muller Code;Baghdad Science Journal;2021-06-20

4. Semantically Secure Symmetric Encryption with Error Correction for Distributed Storage;Security and Communication Networks;2017

5. Private set intersection: New generic constructions and feasibility results;Advances in Mathematics of Communications;2017