Results 31 to 40 of about 342 (169)
Efficient Batch Fully Homomorphic Encryption with a Shorter Key from Ring-LWE
Applied Sciences, 2022 Fully homomorphic encryption allows users to use the computing resources of cloud servers for the computation of encrypted data without worrying about data leakage.
Yuyue Chen, Ruwei Huang, Bo Yang
doaj +1 more source
Obfuscating Conjunctions under Entropic Ring LWE [PDF]
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016 We show how to securely obfuscate conjunctions, which are functions f(x1,...,xn) = ∧i∈I yi where I ⊆ [n] and each literal yi is either just xi or ¬ xi e.g., f(xi,...,x_n) = xi ⊆ ¬ x3 ⊆ ¬ x7 ... ⊆ x{n-1. Whereas prior work of Brakerski and Rothblum (CRYPTO 2013) showed how to achieve this using a non-standard object called cryptographic multilinear maps,
Zvika Brakerski +3 more
openaire +4 more sources
Analysis of Error Dependencies on Newhope
IEEE Access, 2020 Among many submissions to NIST post-quantum cryptography (PQC) project, NewHope is a promising key encapsulation mechanism (KEM) based on the Ring-Learning with errors (Ring-LWE) problem.
Minki Song +5 more
doaj +1 more source
Implementing Conjunction Obfuscation Under Entropic Ring LWE [PDF]
2018 IEEE Symposium on Security and Privacy (SP), 2018 We address the practicality challenges of secure program obfuscation by implementing, optimizing, and experimentally assessing an approach to securely obfuscate conjunction programs proposed in [1]. Conjunction programs evaluate functions f (x_1,...,x_L) = wedge_i in _I y_i, where y_i is either x_i or -x_i and I subseteq [L], and can be used as ...
David Bruce Cousins +7 more
openaire +3 more sources
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
Transactions on Cryptographic Hardware and Embedded Systems, 2019 Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be rendered insecure by Shor’s algorithm when large-scale quantum computers are built.
Utsav Banerjee +2 more
doaj +1 more source
FPGA-Based Hardware Accelerator for Leveled Ring-LWE Fully Homomorphic Encryption
IEEE Access, 2020 Fully homomorphic encryption (FHE) allows arbitrary computation on encrypted data and has great potential in privacy-preserving cloud computing and securely outsource computational tasks.
Yang Su +3 more
doaj +1 more source
Consortium Blockchain Data Sharing Scheme Using Lattice Ciphertext Policy Attribute-Based Encryption [PDF]
Jisuanji gongcheng, 2023 In the process of data sharing, problems of data leakage and trust crisis can arise, and with the emergence of quantum computers, the threat to traditional encryption algorithms is greater.
Lingyun ZHANG, Yuling CHEN
doaj +1 more source
Provably Weak Instances of Ring-LWE Revisited [PDF]
, 2016 In CRYPTO 2015, Elias, Lauter, Ozman and Stange described an attack on the non-dual decision version of the ring learning with errors problem RLWE for two special families of defining polynomials, whose construction depends on the modulusq that is being used.
Castryck, Wouter +2 more
openaire +3 more sources
Chosen Ciphertext k-Trace Attacks on Masked CCA2 Secure Kyber
Transactions on Cryptographic Hardware and Embedded Systems, 2021 Single-trace attacks are a considerable threat to implementations of classic public-key schemes, and their implications on newer lattice-based schemes are still not well understood.
Mike Hamburg +7 more
doaj +1 more source
Ring-LWE: Applications to Cryptography and Their Efficient Realization [PDF]
, 2016 The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by
Sinha Roy, Sujoy +2 more
openaire +3 more sources