CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES-128 circuit in three different ways. One variant takes und...
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
We develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full sec...
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
CRYPTO
2012
Springer
12 years 11 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...
CRYPTO
2012
Springer
12 years 11 months ago
2012
Springer
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
101
click to vote
CRYPTO
2012
Springer
12 years 11 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...