International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:

To receive your credentials via mail again, please click here.

You can also access the full news archive.

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

2015-06-17
00:17 [Pub][ePrint] Concurrent Secure Computation with Optimal Query Complexity, by Ran Canetti and Vipul Goyal and Abhishek Jain

  The multiple ideal query (MIQ) model [Goyal, Jain, and Ostrovsky, Crypto\'10] offers a relaxed notion of security for concurrent secure computation, where the simulator is allowed to query the ideal functionality multiple times per session (as opposed to just once in the standard definition). The model provides a quantitative measure for the degradation in security under concurrent self-composition, where the degradation is measured by the number of ideal queries. However, to date, all known MIQ-secure protocols guarantee only an overall average bound on the number of queries per session throughout the execution, thus allowing the adversary to potentially fully compromise some sessions of its choice. Furthermore, [Goyal and Jain, Eurocrypt\'13] rule out protocols where the simulator makes only an adversary-independent constant number of ideal queries per session.

We show the first MIQ-secure protocol with worst-case per-session guarantee. Specifically, we show a protocol for any functionality that matches the [GJ13] bound: The simulator makes only a constant number of ideal queries in every session. The constant depends on the adversary but is independent of the security parameter.

As an immediate corollary of our main result, we obtain the first password authenticated key exchange (PAKE) protocol for the fully concurrent, multiple password setting in the standard model with no set-up assumptions.



00:17 [Pub][ePrint] Generic Construction of UC-Secure Oblivious Transfer, by Olivier Blazy and Céline Chevalier

  We show how to construct a completely generic UC-secure oblivious transfer scheme from a collision-resistant chameleon hash scheme (CH) and a CCA encryption scheme accepting a smooth projective hash function (SPHF). Our work is based on the work of Abdalla et al. at Asiacrypt 2013, where the authors formalize the notion of SPHF-friendly commitments, i.e. accepting an SPHF on the language of valid commitments (to allow implicit decommitment), and show how to construct from them a UC-secure oblivious transfer in a generic way. But Abdalla et al. only gave a DDH-based construction of SPHF-friendly commitment schemes, furthermore highly relying on pairings. In this work, we show how to generically construct an SPHF-friendly commitment scheme from a collision-resistant CH scheme and an SPHF-friendly CCA encryption scheme. This allows us to propose an instantiation of our schemes based on the DDH, as efficient as that of Abdalla et al., but without requiring any pairing. Interestingly, our generic framework also allows us to propose an instantiation based on the learning with errors (LWE) assumption. For the record, we finally propose a last instantiation based on the decisional composite residuosity (DCR) assumption.



00:17 [Pub][ePrint] SoC it to EM: electromagnetic side-channel attacks on a complex system-on-chip, by J. Longo and E. De Mulder and D. Page and M. Tunstall

  Increased complexity in modern embedded systems has presented various important challenges with regard to side-channel attacks. In particular, it is common to deploy SoC-based target devices with high clock frequencies in security-critical scenarios; understanding how such features align with techniques more often deployed against simpler devices is vital from both destructive (i.e., attack) and constructive (i.e., evaluation and/or countermeasure) perspectives. In this paper, we investigate electromagnetic-based leakage from three different means of executing cryptographic workloads (including the general purpose ARM core, an on-chip co-processor, and the NEON core) on the AM335x SoC. Our conclusion is that addressing challenges of the type above {\\em is} feasible, and that key recovery attacks can be conducted with modest resources.



00:17 [Pub][ePrint] PUA - Privacy and Unforgeability for Aggregation, by Iraklis Leontiadis and Kaoutar Elkhiyaoui and Refik Molvaa and Melek Onen ¨

  xisting work on data collection and analysis for aggregation is mainly

focused on confidentiality issues. That is, the untrusted Aggregator learns only the aggregation result without divulging individual data inputs. In this paper we extend the existing models with stronger security requirements. Apart from the privacy requirements with respect to the individual inputs we ask for unforgeability for the aggregate result. We first define the new security requirements of the model. We also instantiate a protocol for private and unforgeable aggregation for a non-interactive multi-party environment. I.e, multiple unsynchronized users owing to personal sensitive information without interacting with each other contribute their values in a secure way: The Aggregator learns the result of a function without learning individual values and moreover it constructs a proof that is forwarded to a verifier that will let the latter be convinced for the correctness of the computation. The verifier is restricted to not communicate with the users. Our protocol is provably secure in the random oracle model.





2015-06-16
15:55 [Event][New] PKC: Public Key Cryptography

  Submission: 6 October 2015
Notification: 11 December 2015
From March 6 to March 9
Location: Taipei, Taiwan
More Information: http://troll.iis.sinica.edu.tw/pkc16/


15:54 [Event][New] 16th International Conference on Cryptology, Indocrypt (Indocrypt)

  Submission: 13 July 2015
Notification: 7 September 2015
From December 6 to December 10
Location: Bangalore, India
More Information: http://www.indocrypt2015.org/




2015-06-15
23:09 [Job][New] PhD student in Information Security and Cryptography, Chalmers University of Technology, Sweden

  We are looking for an excellent, motivated, self-driven doctoral student to work in the area of information security and cryptography. The position is for five years at the Department of Computer Science and Engineering.

The PhD student will join the Chalmers Systems Security group, working in the area of information and communication security with a focus on security and privacy issues in wearable computing devices. More precisely, the student shall be working on investigating efficient authentication mechanisms for wearable computing devices (RFID tags, sensors connected with mobile phones or other wireless devices) that provide: i) accurate and transparent authentication, ii) rigorous privacy guarantees, even if multiple wearable devices are involved in the authentication. The overall aim of the announced PhD position will be to develop nearly optimal algorithms for achieving security while minimising resource use and guaranteeing privacy-preservation.

More concretely, part of the research will involve the analysis and development of authentication protocols in specific settings. This will include investigating resistance of both existing and novel protocols against different types of attacks, theoretically and experimentally. The project should result in the development of theory and authentication mechanisms for noisy, constrained settings that strike an optimal balance between reliable authentication, privacy-preservation and resource consumption.

The PhD student will be supervised by Prof. Katerina Mitrokotsa. Some previous research related to this research project can be found here: http://www.cse.chalmers.se/~aikmitr/

16:00 [Job][New] Postdoctoral researcher in Quantum Cryptography, University of Amsterdam

  The Institute for Logic, Language & Computation at the University of Amsterdam is looking for a postdoctoral researcher in the area of quantum cryptography, as part of Christian Schaffner’s NWO VIDI Project Cryptography in the Quantum Age.

The aim of the project is to develop new quantum-cryptographic protocols (beyond the task of key distribution) and explore their limitations. An example of an active research is position-based quantum cryptography. Another aspect is to investigate the security of classical cryptographic schemes against quantum adversaries (post-quantum cryptography).

The full-time appointment (38 hours per week) will be on a temporary basis, initially for one year with an extension for a further two years on positive evaluation. Depending on experience, the gross monthly salary will range from €2,476 to €3,908 (scale 10), excl. 8% holiday allowance and 8,3% annual bonus.

Prospective candidates should:

  • hold or be about to obtain a PhD degree in computer science, mathematics or physics;

  • have a proven track record of excellence in cryptography and/or quantum information, as witnessed by a strong publication list in relevant first-tier conference proceedings or journals;

  • have in-depth knowledge of one of the following fields is a plus: parallel repetition, limited-quantum-storage models, continuous variables, quantum security notions;

  • have strong passion for research, a drive to publish and the wish to learn new skills through working with or assisting in guiding PhD and MSc students;

  • have good communication skills in English, both oral and written.



16:00 [Job][New] PhD candidate in Quantum Cryptography, University of Amsterdam

  The Institute for Logic, Language & Computation at the University of Amsterdam is looking for a PhD candidate in the area of quantum cryptography, as part of Christian Schaffner’s NWO VIDI Project Cryptography in the Quantum Age.

The aim of the PhD project is to develop new quantum-cryptographic protocols (beyond the task of key distribution) and explore their limitations. An example of an active research is position-based quantum cryptography. Another aspect is to investigate the security of classical cryptographic schemes against quantum adversaries (post-quantum cryptography).

The full-time appointment at ILLC will be on a temporary basis for a maximum period of four years (18 months plus a further 30 months after a positive evaluation) and should lead to a dissertation (PhD thesis). On the basis of a full-time appointment (38 hours per week), the gross monthly salary amounts to €2,125 during the first year, rising to €2,717 during the fourth year.

Requirements:

  • A Master\'s degree with excellent grades in computer science, mathematics or physics with outstanding results or a comparable degree;

  • candidates with a strong background in cryptography or quantum information are preferred;

  • demonstrated research abilities by completion of an (undergraduate) research project;

  • good academic writing and presentation skills;

  • good social and organisational skills.



16:00 [Event][New] ICICS 2015: International Conference on Information and Communications Security

  Submission: 1 September 2015
From December 9 to December 11
Location: Beijing, China
More Information: http://icics2015.org/


09:17 [Pub][ePrint] An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security, by Michel Abdalla and Fabrice Benhamouda and Alain Passelègue

  In this work, we provide a new algebraic framework for pseudorandom functions which encompasses many of the existing algebraic constructions, including the ones by Naor and Reingold (FOCS\'97), by Lewko and Waters (CCS\'09), and by Boneh, Montgomery, and Raghunathan (CCS\'10), as well as the related-key-secure pseudorandom functions by Bellare and Cash (Crypto\'10) and by Abdalla et al. (Crypto\'14). To achieve this goal, we introduce two versions of our framework. The first, termed linearly independent polynomial security, states that the values $(g^{P_1(\\vec{a})}, \\ldots, g^{P_q(\\vec{a})})$ are indistinguishable from a random tuple of the same size, when $P_1, \\ldots, P_q$ are linearly independent multivariate polynomials of the secret key vector $\\vec{a}$. The second, which is a natural generalization of the first framework, additionally deals with constructions based on the decision linear and matrix Diffie-Hellman assumptions. In addition to unifying and simplifying proofs for existing schemes, our framework also yields new results, such as related-key security with respect to arbitrary permutations of polynomials. Our constructions are in the standard model and do not require the existence of multilinear maps.