A Toolkit for Ring-LWE Cryptography
Top Cited Papers
- 1 January 2013
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- (Leveled) fully homomorphic encryption without bootstrappingPublished by Association for Computing Machinery (ACM) ,2012
- Pseudorandom Functions and LatticesLecture Notes in Computer Science, 2012
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent MessagesLecture Notes in Computer Science, 2011
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- Efficient Lattice (H)IBE in the Standard ModelLecture Notes in Computer Science, 2010
- Bonsai Trees, or How to Delegate a Lattice BasisLecture Notes in Computer Science, 2010
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and MoreLecture Notes in Computer Science, 2010
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsLecture Notes in Computer Science, 2009
- Canonical bases for cyclotomic fieldsApplicable Algebra in Engineering, Communication and Computing, 1990
- On Lovász' lattice reduction and the nearest lattice point problemPublished by Springer Science and Business Media LLC ,1984