A course in computational algebraic number theory
A course in computational algebraic number theory
Modern computer algebra
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Fast quantum algorithms for computing the unit group and class group of a number field
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Additively homomorphic encryption with d-operand multiplications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
i-hop homomorphic encryption and rerandomizable Yao circuits
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Accelerating lattice reduction with FPGAs
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Implementing Gentry's fully-homomorphic encryption scheme
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Homomorphic signatures for polynomial functions
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Benaloh's dense probabilistic encryption revisited
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
The geometry of lattice cryptography
Foundations of security analysis and design VI
Fully homomorphic encryption over the integers with shorter public keys
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Twin clouds: secure cloud computing with low latency
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Can homomorphic encryption be practical?
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Towards ensuring client-side computational integrity
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Information-flow types for homomorphic encryptions
Proceedings of the 18th ACM conference on Computer and communications security
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
(Leveled) fully homomorphic encryption without bootstrapping
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Targeted malleability: homomorphic encryption for restricted computations
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Poster: an implementation of the fully homomorphic smart-vercauteren crypto-system
Proceedings of the 18th ACM conference on Computer and communications security
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
On CCA-Secure somewhat homomorphic encryption
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Improved key generation for gentry's fully homomorphic encryption scheme
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Breaking fully-homomorphic-encryption challenges
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Fully homomorphic encryption based two-party association rule mining
Data & Knowledge Engineering
On the CCA-1 security of somewhat homomorphic encryption over the integers
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Malleable proof systems and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Public key compression and modulus switching for fully homomorphic encryption over the integers
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Fully homomorphic encryption with polylog overhead
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Better bootstrapping in fully homomorphic encryption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Shift-type homomorphic encryption and its application to fully homomorphic encryption
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Reaction attack on outsourced computing with fully homomorphic encryption schemes
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Towards an interpreter for efficient encrypted computation
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Adaptive data protection in distributed systems
Proceedings of the third ACM conference on Data and application security and privacy
When homomorphism becomes a liability
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Group homomorphic encryption: characterizations, impossibility results, and applications
Designs, Codes and Cryptography
Private data warehouse queries
Proceedings of the 18th ACM symposium on Access control models and technologies
ML confidential: machine learning on encrypted data
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
POSTER: Caching oblivious memory access: an extension to the HCRYPT virtual machine
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Smart meter aggregation via secret-sharing
Proceedings of the first ACM workshop on Smart energy grid security
Secure pattern matching using somewhat homomorphic encryption
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Cryptanalysis of Brenner et al.'s somewhat homomorphic encryption scheme
AISC '13 Proceedings of the Eleventh Australasian Information Security Conference - Volume 138
Slight Homomorphic Signature for Access Controlling in Cloud Computing
Wireless Personal Communications: An International Journal
Fully homomorphic SIMD operations
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer. As such, our scheme has smaller message expansion and key size than Gentry’s original scheme. In addition, our proposal allows efficient fully homomorphic encryption over any field of characteristic two.