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
56
views
35
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
6,357
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – ASIACRYPT 2017
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
other
Author(s):
Thomas Prest
Publication date
(Online):
November 30 2017
Publisher:
Springer International Publishing
Read this book at
Publisher
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
Genome Engineering using CRISPR
Most cited references
35
Record
: found
Abstract
: not found
Article
: not found
On Lovász’ lattice reduction and the nearest lattice point problem
L Babai
(1986)
0
comments
Cited
136
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Rényi Divergence and Kullback-Leibler Divergence
Tim van Erven
,
Peter Harremöes
(2014)
0
comments
Cited
129
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Daniele Micciancio
,
Oded Regev
(2007)
0
comments
Cited
95
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
November 30 2017
Pages
: 347-374
DOI:
10.1007/978-3-319-70694-8_13
SO-VID:
84f23a7f-fc5c-4b24-a7fd-b33f2de0760d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
pp. 37
An Existential Unforgeable Signature Scheme Based on Multivariate Quadratic Equations
pp. 65
Post-quantum Security of Fiat-Shamir
pp. 99
Improved Conditional Cube Attacks on Keccak Keyed Modes with MILP Method
pp. 128
Automatic Search of Bit-Based Division Property for ARX Ciphers and Word-Based Division Property
pp. 158
Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160
pp. 187
Linear Cryptanalysis of DES with Asymmetries
pp. 217
Yoyo Tricks with AES
pp. 244
New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers
pp. 267
Large Modulus Ring-LWE $$\ge $$ ≥ Module-LWE
pp. 297
Revisiting the Expected Cost of Solving uSVP and Applications to LWE
pp. 323
Coded-BKW with Sieving
pp. 347
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
pp. 377
Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE
pp. 409
Homomorphic Encryption for Arithmetic of Approximate Numbers
pp. 438
Quantum Fully Homomorphic Encryption with Verification
pp. 471
Access Control Encryption for General Policies from Standard Assumptions
pp. 502
Strengthening Access Control Encryption
pp. 533
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
pp. 567
On the Depth of Oblivious Parallel RAM
pp. 598
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
pp. 629
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead
pp. 660
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM
pp. 693
Authenticated Encryption in the Face of Protocol and Side Channel Leakage
pp. 724
Consolidating Inner Product Masking
pp. 755
The First Thorough Side-Channel Hardware Trojan
pp. 781
Amortizing Randomness Complexity in Private Circuits
Similar content
6,357
Sharper bounds on the box-counting dimension of the singularities in the hyperdissipative Navier-Stokes equations
Authors:
Min Jun Jo
Structural Imaging : Toward a Sharper Subsurface View
Authors:
P. FARMER
,
S. GRAY
,
G Hodgkiss
…
Coronary involvement in Lupus patients. Getting sharper pictures with advanced vascular imaging?
Authors:
J Sun
,
C Yuan
See all similar