Results 31 to 40 of about 357 (170)

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, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs   +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, Seunghwan Lee, Dong-Joon Shin, Eunsang Lee, Young-Sik Kim, Jong-Seon No   +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, Giovanni Di Crescenzo, Kamil Doruk Gür, Kevin King, Yuriy Polyakov, Kurt Rohloff, Gerard W. Ryan, Erkay Savas   +7 more
openaire   +3 more sources

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, Bailong Yang, Chen Yang, Luogeng Tian   +3 more
doaj   +1 more source

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, Tenzin S. Ukyab, Anantha P. Chandrakasan   +2 more
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, Iliashenko, Ilia, Vercauteren, Fréderik   +2 more
openaire   +3 more sources

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, Karmakar, Angshuman, Verbauwhede, Ingrid   +2 more
openaire   +4 more sources

Structured Module Lattice-based Cryptography

Transactions on Cryptographic Hardware and Embedded Systems
The ongoing transition to Post-Quantum Cryptography (PQC) has highlighted the need for cryptographic schemes that offer high security, strong performance, and fine-grained parameter selection.
Joppe W. Bos, Joost Renes, Frederik Vercauteren, Peng Wang   +3 more
doaj   +1 more source

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, Julius Hermelink, Robert Primas, Simona Samardjiska, Thomas Schamberger, Silvan Streit, Emanuele Strieder, Christine van Vredendaal   +7 more
doaj   +1 more source

Polar coding for Ring-LWE-based public key encryption

Cryptography and Communications, 2022
AbstractThe ring learning with errors (RLWE) problem can be used to construct efficient post-quantum public key encryption schemes. An error distribution, normally a Gaussian-like distribution, is involved in the RLWE problem. In this work we focus on using polar codes to alleviate a natural trade-off present in RLWE public key encryption schemes ...
Jiabo Wang, Cong Ling 0001
openaire   +3 more sources