106 Hits in 9.8 sec

Survey on securing data storage in the cloud

Chun-Ting Huang, Lei Huang, Zhongyuan Qin, Hang Yuan, Lan Zhou, Vijay Varadharajan, C.-C. Jay Kuo
2014 APSIPA Transactions on Signal and Information Processing  
In this work, we conduct an in-depth survey on recent research activities of cloud storage security in association with cloud computing.  ...  After an overview of the cloud storage system and its security problem, we focus on the key security requirement triad, i.e., data integrity, data confidentiality, and availability.  ...  As an optional approach, they also proposed a leveled FHE scheme using bootstrapping as optimization to further reduce the per-gate computation down to O(λ 2 ), independent of L. [92] .  ... 
doi:10.1017/atsip.2014.6 fatcat:i5365o5inzh5hb6yrnhvzbjaqu

A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks

Xiaoqiang Sun, F. Richard Yu, Peng Zhang, Weixin Xie, Xiang Peng
2020 Sensors  
In this paper, we provide a comprehensive survey of secure computation based on homomorphic encryption in VANETs.  ...  Encryption is a common method to guarantee the security of vehicle data in the process of data dissemination and computation. However, encrypted vehicle data cannot be analyzed easily and flexibly.  ...  Acknowledgments: We thank the reviewers for their detailed reviews and constructive comments, which have helped to greatly improve the quality of this paper.  ... 
doi:10.3390/s20154253 pmid:32751627 fatcat:2m2lw3vutbh4tbynvotylachye

Bootstrapping in FHEW-like Cryptosystems [article]

Daniele Micciancio, Yuriy Polyakov
2020 IACR Cryptology ePrint Archive  
The FHEW cryptosystem was originally designed based on standard (Ring, circular secure) LWE assumptions, and its initial implementation was able to run bootstrapping in less than 1 second.  ...  FHEW and TFHE are fully homomorphic encryption (FHE) cryptosystems that can evaluate arbitrary Boolean circuits on encrypted data by bootstrapping after each gate evaluation.  ...  The security of the scheme is based on the fact that RLWE (and therefore also RLWE ) is circular secure, because an encryption of s can be trivially computed as the ciphertext (a, b) = (−1, 0), which,  ... 
dblp:journals/iacr/MicciancioP20 fatcat:sokm7hq5k5du7dpvx2oyvmo3uq

On Perfect Correctness without Derandomization [article]

Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
2019 IACR Cryptology ePrint Archive  
Both of our results can be based generically on any perfectly correct, single-key, succinct functional encryption scheme (that is, a scheme supporting Boolean circuits where encryption time is a fixed  ...  Our technique also applies to eliminating correctness errors in generalpurpose functional encryption schemes, but here it is sufficient to rely on the polynomial hardness of the given scheme and of LWE  ...  Acknowledgments We thank Zvika Brakerski for answering several questions related to the perfect correctness of various LWE-based schemes.  ... 
dblp:journals/iacr/AsharovEKP19 fatcat:f6pahcipdvhn5im2i4xjfsrhee

Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications: Securing Data Stored on the Third Party Servers while Processing through Applications

Kurra Mallaiah, S. Ramachandram
2014 International Journal of Computer Applications  
In case of Paillier Algorithm the overhead is 17, 15, 22 and 12 times for addition operation and 278, 399,518 and 346 times for multiplication operation respectively.  ...  Also, we critically discuss homomorphic encryption and CryptDB schemes which are applicable to protect data from malicious third party service environments (cloud computing) and also from insiders for  ...  The authors of [11] propose an approach for secret program execution, based on fully homomorphic encrypted circuits.  ... 
doi:10.5120/17487-7999 fatcat:ifdcjq46yfafrguuj4hxvwb26q

A Decade of Lattice Cryptography

Chris Peikert
2016 Foundations and Trends® in Theoretical Computer Science  
Lattice-based cryptography is the use of conjectured hard problems on point lattices in R n as the foundation for secure cryptographic systems.  ...  The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case  ...  I warmly thank Vadim Lyubashevsky, Dieter van Melkebeek, Oded Regev, Noah Stephens-Davidowitz, Madhu Sudan, and an anonymous reviewer for many valuable comments on earlier drafts.  ... 
doi:10.1561/0400000074 fatcat:5orjj3lrufdalfufl7ju6rnz3e

Identifying Research Challenges in Post Quantum Cryptography Migration and Cryptographic Agility [article]

David Ott, Christopher Peikert, other workshop participants
2019 arXiv   pre-print
An April 2016 report by the National Institute of Standards and Technology (NIST), notably, calls out the need for new standards to replace cryptosystems based on integer factorization and discrete logarithm  ...  The implications of sufficiently large quantum computers for widely used public-key cryptography is well-documented and increasingly discussed by the security community.  ...  Figure 2 : 2 The role of research in PQC migration and cryptographic agility. in lattices), entropy (e.g., lattice-based schemes), and nonzero decryption failure probabilities (e.g., code-based encryptions  ... 
arXiv:1909.07353v1 fatcat:myqmftbsifh43g3ql7ejj4kpoi

Ensuring Security and Privacy Preservation for Cloud Data Services

Jun Tang, Yong Cui, Qi Li, Kui Ren, Jiangchuan Liu, Rajkumar Buyya
2016 ACM Computing Surveys  
We then dwell on existing protection solutions to achieve secure, dependable, and privacy-assured cloud data services including data search, data computation, data sharing, data storage, and data access  ...  We first present security threats and requirements of an outsourcing data service to a cloud, and follow that with a high-level overview of the corresponding security technologies.  ...  When an encryption scheme is based on asymmetric cryptography, its key management is comparatively simple.  ... 
doi:10.1145/2906153 fatcat:c57iz6lswvfxbmhireksha35vm

Privacy-Preserving Deep Learning on Machine Learning as a Service - A Comprehensive Survey

Harry Chandra Tanuwidjaja, Rakyong Choi, Seunggeun Baek, Kwangjo Kim
2020 IEEE Access  
If some encryption scheme supports an operation • on encrypted data Enc(m 1 • m 2 ), this scheme is called Homomorphic Encryption (HE) on an operation •.  ...  However, the privacy of model is not guaranteed because the client must generate an encryption parameter based on the model.  ... 
doi:10.1109/access.2020.3023084 fatcat:inxcd6sbhfewtkm4q3krnkx4oe

Post-Quantum Era Privacy Protection for Intelligent Infrastructures

Lukas Malina, Petr Dzurenda, Sara Ricci, Jan Hajny, Gautam Srivastava, Raimundas Matulevicius, Abasi-amefon O. Affia, Maryline Laurent, Nazatul Haque Sultan, Qiang Tang
2021 IEEE Access  
A practical case study on the Internet of Vehicles (IoV) is presented to demonstrate how PETs can be applied in reality.  ...  Next, we summarize some selected Privacy-Enhancing Technologies (PETs) suitable for privacy-concerned II services, and then map recent PET schemes based on post-quantum cryptographic primitives which are  ...  The scheme is based on ideal lattices and is almost bootstrap able. More details are described in Gentry's Ph.D. thesis [248] . In 2014, Brakerski et al.  ... 
doi:10.1109/access.2021.3062201 fatcat:kqcwwqjfjnds7bzlrid7r6gjlu

Parameter Optimization & Larger Precision for (T)FHE [article]

Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap
2022 IACR Cryptology ePrint Archive  
In theory, Fully Homomorphic Encryption schemes allow to compute any operation over encrypted data.  ...  In this paper, we propose a framework of optimization to solve this open problem. Even though it mainly focuses on TFHE, the method is generic enough to be adapted to any FHE scheme.  ...  In FHE schemes, the technique used to reduce the noise is called bootstrapping. In TFHE-like schemes, bootstrapping is also able to evaluate a LUT at the same time.  ... 
dblp:journals/iacr/BergeratBBCLOT22 fatcat:q4ioqiknxnf6rjkivkewgetz3q

An Efficient Data Protection Architecture Based on Fragmentation and Encryption [article]

Han Qiu
2018 arXiv   pre-print
In this thesis, a completely revisited data protection scheme based on selective encryption is presented.  ...  Then, an agnostic selective encryption based on lossless Discrete Wavelet Transform (DWT) is presented.  ...  However, for protecting the bitmap image, compression is not an option.  ... 
arXiv:1803.04880v1 fatcat:vdw64fjyvzd3roqunaz4yu7yua

Does Fully Homomorphic Encryption Need Compute Acceleration? [article]

Leo de Castro, Rashmi Agrawal, Rabia Yazicigil, Anantha Chandrakasan, Vinod Vaikuntanathan, Chiraag Juvekar, Ajay Joshi
2021 arXiv   pre-print
In this paper, we present an in-depth architectural analysis of the bootstrapping step in FHE.  ...  The cost of the bootstrapping operation is one of the primary barriers to the wide-spread adoption of FHE.  ...  This slowdown is an inherent feature of all existing lattice-based FHE schemes. All of these schemes produce ciphertexts containing a noise term, which is necessary for security.  ... 
arXiv:2112.06396v2 fatcat:2vqidynogjgtvaf3vg225lvmvi

Leveled Fully Homomorphic Encryption Schemes with Hensel Codes [article]

David William Honorio Araujo da Silva, Luke Harmon, Gaetan Delavignette, Carlos Paz de Araujo
2021 IACR Cryptology ePrint Archive  
We propose the use of Hensel codes (a mathematical tool lifted from the theory of p-adic numbers) as an alternative way to construct fully homomorphic encryption (FHE) schemes that rely on the hardness  ...  The efficiency and security (under an AGCD variant) of the public-key scheme are discussed in detail.  ...  Could a simpler FHE scheme be as secure as the lattice-based ones?  ... 
dblp:journals/iacr/SilvaHDA21 fatcat:wyyv6mfgv5g6bc3tesw327vkpi

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
One alternative is lattice-based cryptography which allows the construction of asymmetric public-key encryption and signature schemes that offer a good balance between security, performance, and key as  ...  AbstractAlmost all practically relevant asymmetric cryptosystems like RSA or ECC are either based on the hardness of factoring or on the hardness of the discrete logarithm problem.  ...  Even though research on the practical implementation of ideal lattice-based cryptography is still in an early stage, some ideal lattice-based schemes discussed and implemented in this work come already  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y
« Previous Showing results 1 — 15 out of 106 results