149
Voted
CRYPTO
13 years 3 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....
115
Voted
CRYPTO
13 years 3 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...
112
click to vote
CRYPTO
13 years 3 months ago
2012 Springer 
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
132
Voted
CRYPTO
13 years 3 months ago
2012 Springer 
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
107
click to vote
CRYPTO
13 years 3 months ago
2012 Springer 
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
|
Cryptology