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).

2012-07-18
18:17 [Event][New]

Submission: 15 December 2012
From January 30 to February 1
Location: Dubai, United Arab Emirates

08:35 [Event][New]

Submission: 20 August 2012
From November 28 to December 1
Location: Beijing, China

08:35 [Event][New]

Submission: 20 August 2012
From November 28 to December 1
Location: Beijing, China

2012-07-16
18:39 [Event][New]

Submission: 27 July 2012
From October 12 to October 12
Location: Tampere, Finland

15:20 [Conf][Crypto]

CALL FOR PARTICIPATION **********************************************************
CRYPTO 2012 - The 32nd International Cryptology Conference
Santa Barbara, CA, USA. August 19 - 23, 2012 http://www.iacr.org/conferences/crypto2012/ **********************************************************

CRYPTO 2012 is the 32nd International Cryptology Conference. It is sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the Computer Science Department of UCSB. The conference started in 1981 and has attracted a wide international audience from both the academic and industrial communities. The conference program covers a broad spectrum of topics in cryptology, and it is organized as a 4-day event featuring:
-- two invited talks
-- one tutorial
-- 48 technical presentations

ONLINE REGISTRATION
http://www.iacr.org/conferences/crypto2012/registration-2012.html

INVITED TALKS
-- "The End of Crypto", by Jonathan Zittrain, Harvard University
-- "Recent Advances and Existing Research Questions in Platform Security", by Ernie Brickell, Intel Corporation

TUTORIAL
-- "Pinning Down 'Privacy' in Statistical Databases", by Adam Smith, Pennsylvania State University

DETAILED CONFERENCE PROGRAM
http://www.iacr.org/conferences/crypto2012/program-2012.html

STUDENT STIPENDS

With funding support from the NSF and our industry sponsors, we are now able to award a second round of stipends to student attendees, both domestic and international. Application deadline: July 27th, 2012. http://www.iacr.org/conferences/crypto2012/stipends-2012.html

Google, Microsoft Research, Qualcomm, RIM, Voltage Security

03:17 [Pub][ePrint]

Instead of purchasing and maintaining their own computing infrastructure, scientists can now run data-intensive scientific applications in a hybrid environment such as cloud computing by facilitating its vast storage and computation capabilities. During the scheduling of such scientific applications for execution, various computation data flows will happen between the controller and computing server instances. Amongst various quality-of-service (QoS) metrics, data security is always one of the greatest concerns to scientists because their data may be intercepted or stolen by malicious parties during those data flows, especially for less secure hybrid cloud systems. An existing typical method for addressing this issue is to apply Internet Key Exchange (IKE) scheme to generate and exchange session keys, and then to apply these keys for performing symmetric-key encryption which will encrypt those data flows. However, the IKE scheme suffers from low efficiency due to its low performance of asymmetric-key cryptological operations over a large amount of data and high-density operations which are exactly the characteristics of scientific applications. In this paper, we propose Cloud Computing Background Key Exchange (CCBKE), a novel authenticated key exchange scheme that aims at efficient security-aware scheduling of scientific applications. Our scheme is designed based on randomness-reuse strategy and Internet Key Exchange (IKE) scheme. Theoretical analyses and experimental results demonstrate that, compared with the IKE scheme, our CCBKE scheme can significantly improve the efficiency by dramatically reducing time consumption and computation load without sacrificing the level of security.

03:17 [Pub][ePrint]

In 2010, Sood-Sarje-Singh proposed a dynamic ID-based remote user authentication scheme and claimed that their scheme is more secure than Das et al.\'s scheme and Liao et al.\'s scheme. However, we show that Sood et al.\'s scheme is still vulnerable to malicious user attack, man-in-the-middle attack, stolen smart card attack, off-line ID guessing attack, impersonation attack, and server spoofing attack, making the scheme unfeasible for practical implementation.

03:17 [Pub][ePrint]

We present a generalized learning with errors (LWE) problem, which is essentially a simple and direct extension of the original LWE problem to the case of matrices.

Then we use this new version of LWE problem, which we call matrix LWE problem to build new cryptographic schemes, which include a new scalable key distribution scheme, a new key exchanges scheme and a new simple identity-based encryption scheme.

03:17 [Pub][ePrint]

We introduce the notion of {\\em arithmetic codex}, or {\\em codex} for short.

It encompasses several well-established notions from cryptography (arithmetic secret sharing schemes, i.e., enjoying additive as well as multiplicative properties) and algebraic complexity theory (bilinear complexity of multiplication) in a natural mathematical framework.

Arithmetic secret sharing schemes have important applications to secure multiparty computation and even to {\\em two}-party cryptography. Interestingly, several recent applications to two-party cryptography rely crucially on the existing results on {\\em asymptotically good} families\'\' of suitable such schemes. Moreover, the construction of these schemes requires asymptotically good towers of function fields over finite fields: no elementary (probabilistic) constructions are known in these cases. Besides introducing the notion, we discuss some of the constructions, as well as some limitations.

03:17 [Pub][ePrint]

We present the first wide-strong RFID identification protocol that is based on zero-knowledge. Until now this notion has only been achieved by schemes based on IND-CCA2 encryption. Rigorous proofs in the standard model are provided for the security and privacy properties of our protocol. Furthermore our protocol is the most efficient solution presented in the literature. Using only Elliptic Curve Cryptography (ECC), the required circuit area can be minimized such that our protocol even fits on small RFID tags. Concerning computation on the tag, we only require two scalar-EC point multiplications.

03:17 [Pub][ePrint]

In this paper we propose an efficient and regular ternary algorithm for scalar multiplication on elliptic curves over finite fields of characteristic three.

This method is based on full signed ternary expansion of a scalar to be multiplied. The cost per bit of this algorithm is lower than that of all previous ones.