256
click to vote
CRYPTO
13 years 10 months ago
2012 Springer 
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....
261
click to vote
EUROCRYPT
13 years 10 months ago
2012 Springer 
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
263
click to vote
CTRSA
14 years 3 months ago
2012 Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
255
click to vote
PKC
13 years 10 months ago
2012 Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
223
click to vote
CRYPTO
13 years 10 months ago
2012 Springer 
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...
|
Cryptology