ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
Motivated by the recent progress in improving efficiency of secure computation, we study cut-and-choose oblivious transfer—a basic building block of state-of-the-art constant rou...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
In a selective opening (SO) attack an adversary breaks into a subset of honestly created ciphertexts and tries to learn information on the plaintexts of some untouched (but potent...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
Recent advances in block-cipher theory deliver security analyses in models where one or more underlying components (e.g., a function or a permutation) are ideal (i.e., randomly cho...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
A somewhere statistically binding (SSB) hash, introduced by Hub´aˇcek and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = Hhk(x) using a public has...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
Multilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi (GGH). This ...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
Abstract. Existing protocols for non-interactive multi-party key exchange either (1) support a bounded number of users, (2) require a trusted setup, or (3) rely on knowledge-type a...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
In May 2012, a highly advanced malware for espionage dubbed Flame was found targeting the Middle-East. As it turned out, it used a forged signature to infect Windows machines by MI...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
We provide a security analysis for full-state keyed Sponge and full-state Duplex constructions. Our results can be used for making a large class of Sponge-based authenticated encry...
ASIACRYPT
2015
Springer
8 years 3 months ago
2015
Springer
We investigate new constructions of n-circular counterexamples with a focus on the case of n = 2. We have a particular interest in what qualities a cryptosystem must have to be ab...