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
89
views
33
references
Top references
cited by
65
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,804
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - CRYPTO 2009
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
other
Author(s):
Benny Applebaum
,
David Cash
,
Chris Peikert
,
Amit Sahai
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
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
Value-based Healthcare
Most cited references
33
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
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
Record
: found
Abstract
: not found
Book Chapter
: not found
Lattice-based Cryptography
Daniele Micciancio
,
Oded Regev
(2009)
0
comments
Cited
50
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 595-618
DOI:
10.1007/978-3-642-03356-8_35
SO-VID:
8e85e098-06d4-4284-a0ae-dbd861dfe665
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Reconstructing RSA Private Keys from Random Key Bits
pp. 18
Public-Key Cryptosystems Resilient to Key Leakage
pp. 317
Batch Binary Edwards
pp. 355
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
pp. 541
Privacy-Enhancing Auctions Using Rational Cryptography
pp. 36
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
pp. 55
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
pp. 108
Randomizable Proofs and Delegatable Anonymous Credentials
pp. 126
Computational Differential Privacy
pp. 143
Probabilistically Checkable Arguments
pp. 177
On the Amortized Complexity of Zero-Knowledge Protocols
pp. 192
Linear Algebra with Sub-linear Zero-Knowledge Arguments
pp. 286
How to Encipher Messages on a Small Domain
pp. 303
How to Hash into Elliptic Curves
pp. 374
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
pp. 408
Improving the Security of Quantum Protocols via Commit-and-Open
pp. 445
How Risky Is the Random-Oracle Model?
pp. 577
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
pp. 595
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
pp. 654
Short and Stateless Signatures from the RSA Assumption
Similar content
2,804
Quantum LFSR Structure for Random Number Generation Using QCA Multilayered Shift Register for Cryptographic Purposes.
Authors:
Hyun-Il Kim
,
Jun-Cheol Jeon
Delphi: A cryptographic inference service for neural networks
Authors:
P. MISHRA
,
R. C LEHMKUHL
,
A Srinivasan
…
Universally composable security: A new paradigm for cryptographic protocols
Authors:
R. Canetti
See all similar
Cited by
65
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Authors:
Daniele Micciancio
,
Chris Peikert
On Ideal Lattices and Learning with Errors over Rings
Authors:
Vadim Lyubashevsky
,
Chris Peikert
,
Oded Regev
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Authors:
Damien Stehle
,
Ron Steinfeld
See all cited by