A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Learning with Rounding, Revisited
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. ...
Our approach is inspired by a technique of Goldwasser et al. from ICS '10, which implicitly showed the existence of a "lossy mode" for LWE. ...
This work was partly funded by the European Research Council under ERC Starting Grant 259668-PSPC and ERC Advanced Grant 321310-PERCY. ...
doi:10.1007/978-3-642-40041-4_4
fatcat:ttlw23ggujh5fdb6cmnudibfka
Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. ...
In CRYPTO'11, Brakerski and Segev formalized a framework for studying the security of deterministic public key encryption schemes with respect to auxiliary inputs. ...
Acknowledgements Xiang Xie would like to thank Chris Peikert for many helpful discussions. ...
doi:10.1007/978-3-642-32928-9_1
fatcat:ht3xsmgfqndbjixqqqgpsfsjry
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1804.00640v3 fatcat:syi2hcmvjnc4zmjuslo5rdmr3aOther Versions
We show how to construct this primitive based on the hardness of the learning with errors (LWE) problem. ...
In this model we propose solutions to two tasks - a protocol for efficient classical verification that the untrusted device is "truly quantum," and a protocol for producing certifiable randomness from ...
We refer to Section 2 for definitions of entropic quantities.
It is known that LWE is hard even with binary secrets. ...
arXiv:1804.00640v4
fatcat:vq6krtdnvve65jtvmlak2v5ljq
Obfuscating Compute-and-Compare Programs under LWE
2017
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(ITCS '16) which constructed a conjunction obfuscator under a non-standard "entropic" ring-LWE assumption, while here we obfuscate a significantly broader class of programs under standard LWE. ...
Furthermore, we show that our obfuscator gives new circular-security counter-examples for public-key bit encryption and for unbounded length key cycles. ...
very recently conjunction obfuscators, first using multi-linear maps [BR13] and later a variant of Ring LWE called "entropic Ring LWE" [BVWW16] . ...
doi:10.1109/focs.2017.61
dblp:conf/focs/WichsZ17
fatcat:vw6qdii6y5gbbcrw2lb3vxrgkq
Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We reduce the security of our SSKH PRF family to the hardness of LWE. ...
For the same purpose, we define and compute the mutual information between different linear regression hypotheses that are generated via overlapping training datasets. ...
Multiple variants of LWE such as ring LWE [204] , module LWE [188] , cyclic LWE [150] , continuous LWE [77] , PRIM LWE [278] , middle-product LWE [267] , group LWE [127] , entropic LWE [76] , universal ...
arXiv:2205.00861v1
fatcat:6nimmkefnzedrc2hujlynj6sju
Advances in Quantum Cryptography
2020
Advances in Optics and Photonics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications ...
that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study ...
Eve in a purely lossy channel. ...
doi:10.1364/aop.361502
fatcat:7xp7i42fjffpblk6g4fhlpgg6m