51 Hits in 4.5 sec

Key Recovery Attacks Against NTRU-Based Somewhat Homomorphic Encryption Schemes [chapter]

Massimo Chenal, Qiang Tang
2015 Lecture Notes in Computer Science  
In this paper, we propose efficient key recovery attacks against two NTRU-based SHE schemes, which have not gained much attention in the literature.  ...  Previous research has shown that most existing Somewhat Homomorphic Encryption (SHE) schemes suffer from this attack.  ...  We thank the ePrint editors for pointing out references for three papers on key recovery attack against NTRUEncrypt.  ... 
doi:10.1007/978-3-319-23318-5_22 fatcat:iyt3j3sv2rd27kwnqgzmsamba4

Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes [chapter]

Ricardo Dahab, Steven Galbraith, Eduardo Morais
2015 Lecture Notes in Computer Science  
In this paper we present adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes. Among such schemes, we study the proposal by Bos et al [BLLN13] in 2013.  ...  Such attacks show that one must be very careful about the use of homomorphic encryption in practice. The existence of a key recovery attack means that the scheme is not CCA1-secure.  ...  Concluding Remarks We have described adaptive key recovery attacks on NTRU-based SHE schemes.  ... 
doi:10.1007/978-3-319-17470-9_17 fatcat:pw2ibfw5ubabrd5ldlo3jxubmu

On the Security of Keyed-Homomorphic PKE: Preventing Key Recovery Attacks and Ciphertext Validity Attacks

2020 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
In this short note, we formally show that Keyed-Homomorphic Public Key Encryption (KH-PKE) is secure against key recovery attacks and ciphertext validity attacks that have been introduced as chosen-ciphertext  ...  attacks for homomorphic encryption.  ...  Chenal and Tang [7] have shown a key recovery attack against an NTRU-based scheme proposed by Lopez-Alt et al.  ... 
doi:10.1587/transfun.2020eal2039 fatcat:kbih6duwbfaxvdpcminc67kgei

On the IND-CCA1 Security of FHE Schemes

Prastudy Fauzi, Martha Norberg Hovd, Håvard Raddum
2022 Cryptography  
For each category, we show that the SHE schemes are susceptible to either known adaptive key recovery attacks, a natural extension of known attacks, or our proposed attacks.  ...  There are numerous FHE schemes, all of which are expanded from somewhat homomorphic encryption (SHE) schemes, and some of which are considered viable in practice.  ...  NTRU Attack An adaptive key recovery attack against the NTRU-based scheme BLLN was presented by Dahab, Galbraith, and Morais [18] ; we give the main idea of the attack and its complexity and refer to  ... 
doi:10.3390/cryptography6010013 fatcat:5adm5jv6erbxfcmgmtafyxfpwm

FINAL: Faster FHE instantiated with NTRU and LWE [article]

Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, Nigel P. Smart
2022 IACR Cryptology ePrint Archive  
The first scheme is based solely on NTRU and demonstrates competitive performance against the state-of-the-art FHE schemes including TFHE.  ...  Our second scheme, which is based on both the NTRU and LWE assumptions, outperforms TFHE with a 28% faster bootstrapping and 45% smaller bootstrapping and key-switching keys.  ...  Acknowledgements We would like to thank Leo Ducas for helpful discussions about the security of the NTRU problem.  ... 
dblp:journals/iacr/BonteIPPS22 fatcat:dgnaf2cwrnh2vcnotfly5klnv4

On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes [chapter]

Massimo Chenal, Qiang Tang
2015 Lecture Notes in Computer Science  
At SAC 2011, Loftus et al. showed an IND-CCA1 attack against the somewhat homomorphic encryption scheme presented by Gentry and Halevi at Eurocrypt 2011.  ...  We also develop a key recovery attack that applies to the somewhat homomorphic encryption scheme by van Dijk et al., and our attack is more efficient and conceptually simpler than the one developed by  ...  The multikey FHE of [LATV12] is based on the NTRU scheme [HPS98] and on ideas introduced in [BGV12] . We will not focus on NTRU-based multi-key homomorphic encryption schemes.  ... 
doi:10.1007/978-3-319-16295-9_13 fatcat:amgw5vosrra3novssmfelvyj2u

Increasing System Security with Full Homo-morphic Encryption using Lagrange's Functions

2020 International Journal of Engineering and Advanced Technology  
In this paper, we have implemented a fully homo-morphic system based on Lagrange's functions.  ...  Homo-morphic systems present a novel way to encrypt data, via which operations performed on the encrypted data are fully/partially reflected in the decrypted data.  ...  However, Dahab, Galbraith &Morais (2015) that the NTRU based somewhat-homomorphic encryption scheme are subject to key recovery attacks.Fully Homomorphic Encryption is a scheme that is homomorphic with  ... 
doi:10.35940/ijeat.e9383.069520 fatcat:ucdureewvna3hphs26ningtp4y

Guest Editors' Introduction to the Special Issue on Cryptographic Engineering in a Post-Quantum World: State of the Art Advances

Zhe Liu, Patrick Longa, Cetin Kaya Koc
2018 IEEE transactions on computers  
The authors present several fault attacks against those schemes that recover the entire key recovery with only a few faulty executions, show that those attacks can be mounted in practice based on concrete  ...  Vincent Migliore, Guillaume Bonnoron, and Caroline Fontaine, "Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits".  ...  The authors present several fault attacks against those schemes that recover the entire key recovery with only a few faulty executions, show that those attacks can be mounted in practice based on concrete  ... 
doi:10.1109/tc.2018.2869611 fatcat:aw4i4jifm5ftrgmwn5bgonucje

The Impact of Decryption Failures on the Security of NTRU Encryption [chapter]

Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte
2003 Lecture Notes in Computer Science  
We demonstrate attacks which use decryption failures to recover the private key. Such attacks work for all standard parameter sets, and one of them applies to any padding.  ...  from directly controlling any part of the input to the encryption primitive.  ...  A Specific Attack Based on Controlling m The previous attack works against any padding and already emphasizes the importance of decryption failures on the security of NTRU encryption.  ... 
doi:10.1007/978-3-540-45146-4_14 fatcat:bhrs5vc2xjfzdbn53vln4vn34q

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.  ...  Attractive features of lattice cryptography include apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under  ...  For concrete security against cryptanalytic attacks on the hidden hyperplanes problem [NS98] (and thus to prevent key-recovery attacks), the value of n must be in the hundreds, thus yielding public key  ... 
doi:10.1561/0400000074 fatcat:5orjj3lrufdalfufl7ju6rnz3e

A Thorough Treatment of Highly-Efficient NTRU Instantiations [article]

Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh
2021 IACR Cryptology ePrint Archive  
The first encryption scheme utilizing properties of polynomial rings was NTRU (ANTS '98), but in the recent decade, most research has focused on constructing schemes based on the hardness of the somewhat  ...  Performance-wise, the NTRU schemes instantiated in this paper over NTT-friendly rings of the form Zq[X]/(X d − X d/2 + 1) are the fastest of all public key encryption schemes, whether quantum-safe or not  ...  While the attacks against this parameter regime have not been extended to the one used for public key encryption, it does give some reason for concern.  ... 
dblp:journals/iacr/DumanHKLSU21 fatcat:tytlcdkgwbgmfhmaxoh7dyckae

Survey on Privacy Preservation for Multi-Keyword Search on Data Network

2016 International Journal of Science and Research (IJSR)  
public and private systems on a network through authentication and encryption .  ...  This paper analyzes different methods concerning about privacy of data in the public and private networks and also, analyzes a system based on public cloud platform where data sharing is takes place between  ...  Table 1 : 1 Survey Table Paper Technique and method used Advantages Limitations 1 A Adaptive Key Recovery Attacks on NTRU-based Somewhat Homomorphic 2319-7064 Index Copernicus Value (2013): 6.14  ... 
doi:10.21275/v5i1.nov152679 fatcat:db3fu6wthrbgjip6qef3rxed2m

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
2021 Cryptography  
Some potential research directions that are yet to be explored in code-based cryptography research from the perspective of codes is a key contribution of this paper.  ...  This threat triggered post-quantum cryptography research to design and develop post-quantum algorithms that can withstand quantum computing attacks.  ...  However, this scheme was attacked with a structural key-recovery attack in 2018 [91] . The Random Code-based Signature Scheme (RaCoSS) was submitted to NIST [92] .  ... 
doi:10.3390/cryptography5040038 fatcat:wkb43zunwjagbnljc6brfou4ty

Challenges of Fully Homomorphic Encryptions for the Internet of Things

Licheng WANG, Jing LI, Haseeb AHMAD
2016 IEICE transactions on information and systems  
In particular, some issues about designing noise-free FHE schemes would be addressed. key words: Internet of Things (IoT), fully homomorphic encryption (FHE), challenges, cloud * In a modern hospital,  ...  homomorphic encryption (SHE).  ...  Thus, all of these schemes are so weak to resist against even the chosen plaintext attacks.  ... 
doi:10.1587/transinf.2015ini0003 fatcat:zx3mj3425fbb5exactwj4sm3fm

A Public-key Encryption Scheme Based on Non-linear Indeterminate Equations (Giophantus) [article]

Koichiro Akiyama, Yasuhiro Goto, Shinya Okumura, Tsuyoshi Takagi, Koji Nuida, Goichiro Hanaoka, Hideo Shimizu, Yasuhiko Ikematsu
2017 IACR Cryptology ePrint Archive  
As a scheme to avoid such attacks, we propose a public-key encryption scheme based on the "smallest" solution problem in the non-linear solution spaces of multivariate indeterminate equations that was  ...  Then, we perform computational experiments based on known attack methods and evaluate that the key size of our scheme under the linear condition. This paper is a revised version of [4] .  ...  Acknowledgments The authors thank Keita Xagawa for suggesting us the attack [6] and [22] which may work against our scheme when we choose the parameter n to be composite.  ... 
dblp:journals/iacr/AkiyamaGOTNHSI17 fatcat:hqqgqur7ifb2rkxn4vujoai3sy
« Previous Showing results 1 — 15 out of 51 results