نتایج جستجو برای: ring lwe

تعداد نتایج: 123352  

Journal: :J. Inf. Sci. Eng. 2017
Yang Yang Shu-Lve Yang Fenghe Wang Jin Sun

In remote data storage system, the information privacy is the main concern of the users. Data confidentiality, keyword search and access control are important characteristics that should be supported in such system. With the advent of quantum computer, number theory related assumptions are vulnerable to quantum attack. In this context, we propose a post-quantum secure searchable encryption sche...

Journal: :IACR Cryptology ePrint Archive 2016
Jung Hee Cheon Damien Stehlé

Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regev’s Learning With Errors problem (LWE) and HowgraveGraham’s Approximate Greatest Common Divisor problem (AGCD). Our first contribution is a reduction from LWE to AGCD. As a second contribution, we describe a new AGCD-based fully homomorphic encryption scheme, which outperforms all ...

2010
Oded Regev

In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.

Journal: :Lecture Notes in Computer Science 2021

We initiate the study of multi-party computation for classical functionalities in plain model, with security against malicious quantum adversaries. observe that existing techniques readily give a polynomial-round protocol, but our main result is construction constant-round post-quantum computation. assume mildly super-polynomial hardness learning errors (LWE), and polynomial an LWE-based circul...

Journal: :IACR Cryptology ePrint Archive 2011
Gilbert Baumslag Nelly Fazio Antonio Nicolosi Vladimir Shpilrain William E. Skeith

We propose a generalization of the learning parity with noise (LPN) and learning with errors (LWE) problems to an abstract class of group-theoretic learning problems that we term learning homomorphisms with noise (LHN). This class of problems contains LPN and LWE as special cases, but is much more general. It allows, for example, instantiations based on non-abelian groups, resulting in a new av...

Journal: :علوم 0

in this note we introduce the notion of weak mccoy rings as a generalization of mccoy rings, and investigate their properties. also we show that, if is a semi-commutative ring, then is weak mccoy if and only if is weak mccoy.

Journal: :International Journal of Cloud Computing and Services Science (IJ-CLOSER) 2012

Journal: :archives of trauma research 0
behnam sanei department of surgery, isfahan university of medical sciences, isfahan, ir iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) mohsen mahmoudieh department of surgery, isfahan university of medical sciences, isfahan, ir iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) hamid talebzadeh department of surgery, isfahan university of medical sciences, isfahan, ir iran; department of surgery, isfahan university of medical sciences, isfahan, ir iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) shahab shahabi shahmiri department of surgery, isfahan university of medical sciences, isfahan, ir iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) zahra aghaei department of surgery, isfahan university of medical sciences, isfahan, ir iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences)

background the optimal management of hemodynamically stable asymptomatic patients with anterior abdominal stab wounds (aasws) remains controversial. the goal is to identify and treat injuries in a safe cost-effective manner. common evaluation strategies are local wound exploration (lwe), diagnostic peritoneal lavage (dpl), serial clinical assessment (scas) and computed tomography (ct) imaging. ...

Journal: :Designs, Codes and Cryptography 2017

Journal: :IACR Cryptology ePrint Archive 2014
Fabrice Benhamouda Stephan Krenn Vadim Lyubashevsky Krzysztof Pietrzak

We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge, based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all elements have inverses, we construct a perfectly binding commitment scheme whose hiding property relies on the RLWE assumption. Our scheme maps elements from the ring (or equivalently, n elements fro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید