Sciweavers

137 search results - page 11 / 28
» Verifiable Attribute Based Encryption
Sort
View
EUROCRYPT
2011
Springer
12 years 11 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
USENIX
1994
13 years 9 months ago
Key Management in an Encrypting File System
As distributed computing systems grow in size, complexity and variety of application, the problem of protecting sensitive data from unauthorized disclosure and tampering becomes i...
Matt Blaze
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 8 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
CCS
2008
ACM
13 years 10 months ago
Black-box accountable authority identity-based encryption
A well-known concern in the setting of identity based encryption is that the PKG is all powerful and has to be completely trusted. To mitigate this problem, the notion of Accounta...
Vipul Goyal, Steve Lu, Amit Sahai, Brent Waters