Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
33
views
29
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,227
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Better Algorithms for LWE and LWR
other
Author(s):
Alexandre Duc
,
Florian Tramèr
,
Serge Vaudenay
Publication date
(Online):
April 14 2015
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
The IET
Most cited references
29
Record
: found
Abstract
: not found
Article
: not found
Probability Inequalities for Sums of Bounded Random Variables
Wassily Hoeffding
(1963)
0
comments
Cited
784
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Craig Gentry
,
Amit Sahai
,
Brent Waters
(2013)
0
comments
Cited
103
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Noise-tolerant learning, the parity problem, and the statistical query model
Hal Wasserman
,
Avrim Blum
,
Adam Kalai
(2003)
0
comments
Cited
81
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
April 14 2015
Pages
: 173-202
DOI:
10.1007/978-3-662-46800-5_8
SO-VID:
e536e08a-3b34-457f-9c3c-5c3168b6e74b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Cryptanalysis of the Multilinear Map over the Integers
pp. 15
Robust Authenticated-Encryption AEZ and the Problem That It Solves
pp. 45
On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
pp. 77
A Provable-Security Analysis of Intel’s Secure Key RNG
pp. 101
A Formal Treatment of Backdoored Pseudorandom Generators
pp. 156
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
pp. 173
Better Algorithms for LWE and LWR
pp. 231
Cryptanalytic Time-Memory-Data Tradeoffs for FX-Constructions with Applications to PRINCE and PRIDE
pp. 254
A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
pp. 287
Structural Evaluation by Generalized Integral Property
pp. 315
Cryptanalysis of SP Networks with Partial Non-Linear Layers
pp. 345
The Sum Can Be Weaker Than Each Part
pp. 368
SPHINCS: Practical Stateless Hash-Based Signatures
pp. 401
Making Masking Security Proofs Concrete
pp. 430
Ciphers for MPC and FHE
pp. 457
Verified Proofs of Higher-Order Masking
pp. 486
Inner Product Masking Revisited
pp. 513
Fully Homomophic Encryption over the Integers Revisited
pp. 537
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
pp. 559
KDM-CCA Security from RKA Secure Authenticated Encryption
pp. 584
On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
pp. 617
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
pp. 641
Bootstrapping for HElib
pp. 673
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
pp. 702
How to Efficiently Evaluate RAM Programs with Malicious Security
pp. 733
Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
pp. 762
Twisted Polynomials and Forgery Attacks on GCM
pp. 789
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
Similar content
2,227
Privacy Preserving BGN-Type Parallel Homomorphic Encryption Algorithm Based on LWE. J
Authors:
Z Min
,
G Yang
,
J. Wang
…
A multi-key SMC protocol and multi-key FHE based on some-are- errorless LWE
Authors:
H Wang
,
Y Feng
,
Y DING
…
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE
Authors:
Ron Rothblum
,
Adam Sealfon
,
Katerina Sotiraki
See all similar
Cited by
4
Coded-BKW: Solving LWE Using Lattice Codes
Authors:
Qian Guo
,
Thomas Johansson
,
Paul Stankovski
Coded-BKW with Sieving
Authors:
Qian Guo
,
Thomas Johansson
,
Erik Mårtensson
…
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Authors:
,
See all cited by