Sciweavers

341 search results - page 7 / 69
» Deniable Functional Encryption
Sort
View
CACM
2010
117views more  CACM 2010»
14 years 10 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 27 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
CRYPTOLOGIA
2006
155views more  CRYPTOLOGIA 2006»
14 years 10 months ago
The Whirlpool Secure Hash Function
In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less tha...
William Stallings
JOC
1998
162views more  JOC 1998»
14 years 10 months ago
A Software-Optimized Encryption Algorithm
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...
Phillip Rogaway, Don Coppersmith
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...