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

Most cited references 12

Record: found
Abstract: not found
Article: not found

A hierarchy of polynomial time lattice basis reduction algorithms

C.P. Schnorr (1987)

0 comments Cited 105 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 104 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Conference Proceedings: not found

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan (2012)

0 comments Cited 70 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2016

Publication date (Online): July 21 2016

Pages: 190-213

DOI: 10.1007/978-3-662-53018-4_8

SO-VID: ab4c1bd1-2503-4531-8e49-5dd04f9f2c04

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 14

See all cited by

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

Read this book at

Related collections

The Dynamic Brain

Most cited references 12

A hierarchy of polynomial time lattice basis reduction algorithms

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,156

Cited by 14