loading
Papers

Research.Publish.Connect.

Paper

Authors: Tikaram Sanyashi ; Darshil Desai and Bernard Menezes

Affiliation: Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai and India

ISBN: 978-989-758-378-0

Keyword(s): Cloud Computing, Symmetric Key Encryption, Homomorphic Encryption, Approximate Greatest Common Divisor Problem, Lattices, Orthogonal Lattice Attack.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security

Abstract: Economies of scale make cloud computing an attractive option for small and medium enterprises. However, loss of data integrity or data theft remain serious concerns. Homomorphic encryption which performs computations in the encrypted domain is a possible solution to address these concerns. Many partially homomorphic encryption schemes that trade off functionality for lower storage and computation cost have been proposed. However, not all these schemes have been adequately investigated from the security perspective. This paper analyses a suite of such proposed schemes based on the hardness of the Approximate GCD problem. We show that two of these schemes are vulnerable to the Orthogonal Lattice attack. The execution time of the attack is a function of various parameters including message entropy. For the recommended set of parameters, the execution time of the attack is no greater than 1 day on a regular laptop.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.172.195.49

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Sanyashi, T.; Desai, D. and Menezes, B. (2019). Cryptanalysis of Homomorphic Encryption Schemes based on the Aproximate GCD Problem.In Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, ISBN 978-989-758-378-0, pages 517-522. DOI: 10.5220/0008071605170522

@conference{secrypt19,
author={Tikaram Sanyashi. and Darshil Desai. and Bernard Menezes.},
title={Cryptanalysis of Homomorphic Encryption Schemes based on the Aproximate GCD Problem},
booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,},
year={2019},
pages={517-522},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008071605170522},
isbn={978-989-758-378-0},
}

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,
TI - Cryptanalysis of Homomorphic Encryption Schemes based on the Aproximate GCD Problem
SN - 978-989-758-378-0
AU - Sanyashi, T.
AU - Desai, D.
AU - Menezes, B.
PY - 2019
SP - 517
EP - 522
DO - 10.5220/0008071605170522

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.