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
3
views
39
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
4,322
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2021 : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part II
Lattice Reduction with Approximate Enumeration Oracles
other
Author(s):
Martin R. Albrecht
,
Shi Bai
,
Jianwei Li
,
Joe Rowell
Publication date
(Online):
August 11 2021
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
Model Reduction of Parametrized Systems 2015
Most cited references
39
Record
: found
Abstract
: not found
Book
: not found
Sphere Packings, Lattices and Groups
J. H. Conway
,
N. J. A. Sloane
(1999)
0
comments
Cited
151
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Generating hard instances of lattice problems (extended abstract)
M. Ajtai
(1996)
0
comments
Cited
100
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Trapdoors for hard lattices and new cryptographic constructions
Vinod Vaikuntanathan
,
Chris Peikert
,
Craig Gentry
(2008)
0
comments
Cited
74
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2021
Publication date (Online):
August 11 2021
Pages
: 732-759
DOI:
10.1007/978-3-030-84245-1_25
SO-VID:
05ba1e1f-6f7a-46ef-b3dc-1c35c9cd42f8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
pp. 33
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
pp. 64
YOSO: You Only Speak Once
pp. 94
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
pp. 124
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
pp. 155
Broadcast-Optimal Two Round MPC with an Honest Majority
pp. 185
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
pp. 214
On the Round Complexity of Black-Box Secure MPC
pp. 244
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting
pp. 275
Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem
pp. 305
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions
pp. 335
Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings
pp. 365
Pushing the Limits of Valiant’s Universal Circuits: Simpler, Tighter and More Compact
pp. 395
Oblivious Key-Value Stores and Amplification for Private Set Intersection
pp. 426
MHz2k: MPC from HE over \(\mathbb {Z}_{2^k}\) with New Packing, Simpler Reshare, and Better ZKP
pp. 457
Sublinear GMW-Style Compiler for MPC with Preprocessing
pp. 486
Limits on the Adaptive Security of Yao’s Garbling
pp. 519
Subtractive Sets over Cyclotomic Rings
pp. 549
A Compressed \(\varSigma \)-Protocol Theory for Lattices
pp. 580
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs
pp. 641
Deniable Fully Homomorphic Encryption from Learning with Errors
pp. 673
Counterexamples to New Circular Security Assumptions Underlying iO
pp. 701
How to Meet Ternary LWE Keys
pp. 732
Lattice Reduction with Approximate Enumeration Oracles
pp. 760
Towards Faster Polynomial-Time Lattice Reduction
pp. 791
Lower Bounds on Lattice Sieving and Information Set Decoding
Similar content
4,322
Enumeration of leukocyte infiltration in solid tumors by confocal laser scanning microscopy
Authors:
Brad J. Biggerstaff
,
B Weidow
,
A Amirkhosravi
…
Evaluation of media for enumerating heat-stressed, benzoate-resistant Zygosaccharomyces bailii
Authors:
Adel Makdesi
,
Larry R Beuchat
The 'most probable number' method for enumerating infective propagules of vesicular arbuscular mycorrhizal fungi in soil
Authors:
WM Porter
See all similar