International Association for Cryptologic Research

# IACR News Central

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

2013-08-21
03:17 [Pub][ePrint]

K.Yoneyama et al. introduces the Leaky Random Oracle Model at ProvSec2008, which only considers the leakage of the hash list of a hash function used by a cryptosystem due to various attacks caused by implementation or sloppy usages. However, an important fact is that such attacks not only leak the hash list of a hash function, but also leak other secret states outside the hash list of a cryptosystem (e.g. the secret key). In most cases, an adversary may be more interesting in revealing these secret states. Therefore, the Leaky Random Oracle Model is very limited because it only considers the leakage of the hash list and does not consider the leakage of other secret states. In this paper, we present a new leakage model based on the Leaky Random Oracle Model. In our new model, both the secret states (secret key) and the hash list can be leaked. Furthermore, the secret key can be leaked continually. Hence, our new model is more universal and stronger than the Leaky Random Oracle Model and some other leakage models. Furthermore, we give a provable security public key encryption scheme which is IND-CCA secure in our new model.

03:17 [Pub][ePrint]

In this paper we present a parallel approach to compute interleaved Montgomery multiplication. This approach is particularly suitable to be computed on 2-way single instruction, multiple data platforms as can be found on most modern computer architectures in the form of vector instruction set extensions. We have implemented this approach for tablet devices which run the x86 architecture (Intel Atom Z2760) using SSE2 instructions as well as devices which run on the ARM platform (Qualcomm MSM8960, NVIDIA Tegra 3 and 4) using NEON instructions. When instantiating modular exponentiation with this parallel version of Montgomery multiplication we observed a performance increase of more than a factor of 1.5 compared to

the sequential implementation in OpenSSL for the classical arithmetic logic unit on the Atom platform for 2048-bit moduli.

2013-08-20
15:40 [Service]

IACR and Springer are pleased to offer you free access to the Journal of Cryptology and the IACR proceedings volumes for CRYPTO, EUROCRYPT, ASIACRYPT, FSE, CHES, PKC, and TCC. Simply use the links below to access these publications.

15:03 [Event][New]

Submission: 5 September 2013
From February 24 to February 28
Location: San Francisco, USA

15:00 [Job][Update]

We are looking for an excellent, motivated, self-driven post-doctoral researcher to work in the area of cryptography with a focus on privacy-preserving biometrics. More precisely, the researcher will be employed in the European FP7 project BEAT (Biometric Evaluation and Testing). The researcher is expected to investigate and analyse the security and privacy of existing privacy-preserving biometric authentication systems against different types of attacks and propose new ones robust to the identified weaknesses.

Some info about the BEAT research project can be found here: http://www.beat-eu.org

The employment is limited to 1 year and may be extended to 1 more year.

The applicant should have Ph.D. degree preferably in information security, computer science, cryptography or equivalent by the start of the appointment. Experience in security communication protocols, provable security, homomorphic encryption, zero-knowledge proofs, privacy-preservation and biometric authentication is highly valued.

2013-08-19
08:59 [Job][New]

We are looking for an excellent, motivated, self-driven post-doctoral researcher to work in the area of cryptography with a focus on privacy-preserving biometrics. More precisely, the researcher will be employed in the European FP7 project BEAT (Biometric Evaluation and Testing). The researcher is expected to investigate and analyse the security and privacy of existing privacy-preserving biometric authentication systems against different types of attacks and propose new ones robust to the identified weaknesses.

Some info about the BEAT research project can be found here: http://www.beat-eu.org

The employment is limited to 1 year and may be extended to 1 more year.

The applicant should have Ph.D. degree preferably in information security, computer science, cryptography or equivalent by the start of the appointment. Experience in security communication protocols, provable security, homomorphic encryption, zero-knowledge proofs, privacy-preservation and biometric authentication is highly valued.

08:59 [Job][New]

The cryptography group in the Information Security discipline at the Queensland University of Technology (QUT) in Brisbane, Australia, invites applications for PhD students starting in 2014 in various aspects of cryptographic protocols and algorithms. We are always interested in taking on new research students with appropriate background knowledge and an interest in challenging problems in the area.

Research interests of the group include:

• design and cryptanalysis of stream ciphers
• elliptic curves and pairings; identity-based cryptography
• lattice-based cryptography
• design and analysis of key exchange protocols
• real-world Internet cryptography protocols

Interested students should contact one of the potential supervisors (Emeritus Professor Ed Dawson, Associate Professor Xavier Boyen, Dr Leonie Simpson, Dr Douglas Stebila) to discuss the availability of a suitable project. For these projects students will be expected to have a strong mathematical and computer science background. Previous experience in cryptography and networking is an advantage.

QUT offers competitive scholarships for living expenses and tuition fee waivers to support domestic and international PhD students. Applications for admission are accepted year-round, but the deadline for the annual scholarship competition is Sunday 13 October 2013.

08:59 [Job][Update]

We are looking for a Post-Doc in cryptography. Contact us if you have (or about to receive) a Ph.D. in cryptography (or very related subject), an excellent publication record that includes IACR conferences and you want to work in a fun environment in Athens - Greece.

Funding is through the European Research Council project CODAMODA. More information about the Crypto.Sec group at the National and Kapodistrian University of Athens can be found here http://crypto.di.uoa.gr

Applications will be considered immediately. The position is for 1 year with the possibility of renewal. Salary is competitive.

2013-08-17
21:17 [Pub][ePrint]

Multiplicative linear secret sharing is a fundamental notion in the area of secure multi-party computation (MPC) and,

since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that

the product of two secrets is obtained as a linear function of the vector consisting of the

coordinate-wise product of two respective share-vectors\'\'. This paper focuses on the following foundational question, which is novel to the best of our knowledge. Suppose we {\\em abandon the latter linearity condition} and instead require that this product is obtained by {\\em some},

not-necessarily-linear product reconstruction function\'\'. {\\em Is the resulting notion equivalent to

multiplicative linear secret sharing?} We show the (perhaps somewhat counter-intuitive) result that this relaxed notion is strictly {\\em more general}.

Concretely, fix a finite field $\\FF_q$ as the base field $\\FF_q$ over which linear secret sharing is considered.

Then we show there exists an (exotic) linear secret sharing scheme with an unbounded number of players $n$

such that it has $t$-privacy with $t\\approx \\sqrt{n}$

and such that it does admit a product reconstruction function, yet this function is {\\em necessarily} nonlinear. Our proof is based on

combinatorial arguments involving bilinear forms. It extends to similar separation results for important variations,

such as strongly multiplicative secret sharing.