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
41
views
11
references
Top references
cited by
46
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,987
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2012
Fully Homomorphic Encryption with Polylog Overhead
other
Author(s):
Craig Gentry
,
Shai Halevi
,
Nigel P. Smart
Publication date
(Print):
2012
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
ScienceOpen Research
Most cited references
11
Record
: found
Abstract
: not found
Conference Proceedings
: not found
(Leveled) fully homomorphic encryption without bootstrapping
Vinod Vaikuntanathan
,
Zvika Brakerski
,
Craig Gentry
(2012)
0
comments
Cited
123
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Zvika Brakerski
,
Vinod Vaikuntanathan
(2011)
0
comments
Cited
98
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Can homomorphic encryption be practical?
Vinod Vaikuntanathan
,
Michael Naehrig
,
Kristin Lauter
(2011)
0
comments
Cited
81
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 465-482
DOI:
10.1007/978-3-642-29011-4_28
SO-VID:
439ec712-0ed6-4830-8525-0dcfe5d0d55c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 27
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
pp. 45
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
pp. 117
Identity-Based Encryption Resilient to Continual Auxiliary Leakage
pp. 135
Quantum Proofs of Knowledge
pp. 228
Identity-Based (Lossy) Trapdoor Functions and Applications
pp. 246
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
pp. 263
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
pp. 318
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
pp. 336
Minimalism in Cryptography: The Even-Mansour Scheme Revisited
pp. 355
Message Authentication, Revisited
pp. 392
Narrow-Bicliques: Cryptanalysis of Full IDEA
pp. 428
Statistical Tools Flavor Side-Channel Collision Attacks
pp. 446
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
pp. 465
Fully Homomorphic Encryption with Polylog Overhead
pp. 502
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
pp. 572
Tightly-Secure Signatures from Lossy Identification Schemes
pp. 591
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
pp. 609
Scalable Group Signatures with Revocation
pp. 628
Incremental Deterministic Public-Key Encryption
pp. 645
Standard Security Does Not Imply Security against Selective-Opening
pp. 719
Pseudorandom Functions and Lattices
pp. 738
Lattice Signatures without Trapdoors
Similar content
1,987
The polylog quotient and the Goncharov quotient in computational Chabauty-Kim theory II
Authors:
Ishai Dan-Cohen
,
David Corwin
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
Authors:
Harald Räcke
,
Stefan Schmid
,
Ruslan Zabrodin
Short PCPs with Polylog Query Complexity
Authors:
Eli Ben-Sasson
,
Madhu Sudan
,
I. Sasson
…
See all similar
Cited by
46
Fully homomorphic SIMD operations
Authors:
N. Smart
,
F Vercauteren
Homomorphic Encryption for Arithmetic of Approximate Numbers
Authors:
Jung Cheon
,
Andrey Kim
,
Miran Kim
…
Algorithms in HElib
Authors:
Shai Halevi
,
Victor Shoup
See all cited by