*09:17* [Pub][ePrint]
Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption, by Keita Emura and Goichiro Hanaoka and Koji Nuida and Go Ohtake and Takahiro Matsuda and Shota Yamada
In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can \\lq\\lq freely\'\' perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic property can never be achieved simultaneously. In this paper, we show that CCA security and the homomorphic property can be simultaneously handled in situations that the user(s) who can perform homomorphic operations on encrypted data should be controlled/limited, and propose a new concept of homomorphic public-key encryption, which we call \\emph{keyed-homomorphic public-key encryption} (KH-PKE). By introducing a secret key for homomorphic operations, we can control who is allowed to perform the homomorphic operation. To construct KH-PKE schemes, we introduce a new concept, a \\emph{homomorphic transitional universal hash family}, and present a number of KH-PKE schemes through hash proof systems. We also present a practical construction of KH-PKE from the DDH assumption. For $\\ell$-bit security, our DDH-based scheme yields only $\\ell$-bit longer ciphertext size than that of the Cramer-Shoup PKE scheme.

*09:17* [Pub][ePrint]
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full $\\mbox{AES}^{2}$, by Itai Dinur and Orr Dunkelman and Nathan Keller and Adi Shamir
The Even-Mansour (EM) encryption scheme received a lot of attention in the last couple of years due to its exceptional simplicity and tight security proofs.The original $1$-round construction was naturally generalized into $r$-round structures with one key, two alternating keys, and completely independent keys.

In this paper we describe the first key recovery attack on the one-key 3-round version of EM which is asymptotically faster than exhaustive search

(in the sense that its running time is $o(2^n)$ rather than $O(2^n)$ for an $n$-bit key).

We then use the new cryptanalytic techniques in order to improve the best known

attacks on several concrete EM-like schemes. In the case of LED-128, the best previously known attack could only be applied to 6 of its 12 steps. In this paper we develop a new attack which increases the number of attacked steps to 8, is slightly faster than the previous attack on 6 steps, and uses about a thousand times less data.

Finally, we describe the first attack on the full $\\mbox{AES}^{2}$ (which uses two complete AES-128 encryptions and three independent $128$-bit keys, and looks exceptionally strong) which is about 7 times faster than a standard meet-in-the-middle attack, thus violating its security claim.

*09:17* [Pub][ePrint]
Pickle: A HASH Design, by Lan Luo and Yalan Ye and Zehui Qu and Sharon Goldberg and Xan Du
For make the cryptography design eatable and popular,we design the pickle HASH carefully. The pickle can deal large

data into HASH value with 1024bytes block quickly. There are

normal mode and operation mode of pickle from Keccak and

Shabal respectively. The nonlinear transformation is from 3fish of

Skein, which is only use up the MIX function. The pickle is speed

up because of no memory operation mode. The core function P is 8

times MIX without linear permutation and subkey involving in. So,

the full pickle is similar to the interlace code plus a little bit

nonlinear function. The nonlinear character is equal to the Skein

so that we consider it\'s secure. The output from filter function

strong the linear character of pickle.

*22:33* [Job][Update]
PostDoc Position in Lightweight Cryptography for the Internet of Things, *University of Luxembourg*
The Laboratory of Algorithmics, Cryptology and Security (LACS) of the University of Luxembourg is looking for a post-doctoral researcher in the area of lightweight cryptography. The successful candidate will contribute to a research project entitled \\\"Applied Cryptography for the Internet of Things (ACRYPT)\\\", which is funded by the Fonds National de la Recherche (FNR). Besides conducting high-quality research, the tasks associated with this position include the co-supervision of a Ph.D. student and the dissemination of research results. The ACRYPT project is led by Prof. Alex Biryukov and expected to start in summer 2013.Candidates must hold a Ph.D. degree (or be in the final stages of a Ph.D. program) in cryptography or a closely related discipline. Applications from researchers with experience in embedded systems security, network security, privacy/anonymity, or mobile/wireless security will also be considered. Preference will be given to candidates with a strong publication record including papers in top-tier crypto/security conference proceedings or journals. Candidates with an interest to conduct leading-edge research in one of the following areas are particularly encouraged to apply:

Design and analysis of symmetric cryptographic primitives

Side-channel attacks (e.g. DPA) on symmetric cryptographic primitives and countermeasures

The position is available from July 2013 on basis of a fixed-term contract for a duration of three years, which includes a probation period of six months. LACS offers excellent working conditions in an attractive research environment and a highly competitive salary. Interested candidates are invited to submit their application by email to lacs.acrypt(at)gmail.com. The application material should contain a cover letter explaining the candidate\\\'s motivation and research interests, a detailed CV (including photo), a list of publications, copies of diploma certificates, and nam

*22:32* [Job][Update]
Professor of Cyber Security, *Tallinn University of Technology, Estonia*
The Department of Computer Science at Tallinn University of Technology is looking for a full Professor of Cyber Security.This appointment is part of the strategic growth of the Department of Computer Science, supported by the Estonian *IT Academy* program. The department is seeking an energetic and dynamic candidate who will contribute to and complement the current research and teaching activities, and promote cooperation with national and international partners in academia, industry, government, and military. The candidateâ€™s main responsibility in the areas of cyber security will be research activities, supervising Ph.D work, leading departmentâ€™s cyber security research and study program, and teaching courses on postgraduate level.

The successful candidate will serve as a leader of research and teaching in the field of practical cyber security and digital forensics.

The position has currently been announced for the period Feb 2014 - Jan 2019. It can be extended. Ask the contact persons about details.