ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
At EUROCRYPT 2012 Pandey and Rouselakis introduced the notion of property preserving symmetric encryption which enables checking for a property on plaintexts by running a public te...
ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
We formalize the standard application of identity-based encryption (IBE), namely noninteractive secure communication, as realizing an ideal system which we call delivery controlle...
ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
Abstract. It is well known that three and four rounds of balanced Feistel cipher or Luby-Rackoff (LR) encryption for two blocks messages are pseudorandom permutation (PRP) and str...
ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
In CRYPTO 2003, Halevi and Rogaway proposed CMC, a tweakable enciphering scheme (TES) based on a blockcipher. It requires two blockcipher keys and it is not inverse-free (i.e., the...
ASIACRYPT
2015
Springer
8 years 8 months ago
2015
Springer
Predicate encryption is an advanced form of public-key encryption that yield high flexibility in terms of access control. In the literature, many predicate encryption schemes hav...
ASIACRYPT
2015
Springer
8 years 8 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 8 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 8 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 8 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...