18 search results - page 3 / 4 » Minimizing the Number of Bootstrappings in Fully Homomorphic... |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
CCS
2011
ACM
12 years 5 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
IACR
2011
12 years 5 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
IACR
2011
12 years 5 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
JOC
2011
12 years 8 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...