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 get this service 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).

2013-09-19
15:17 [Pub][ePrint] Improved Cryptanalysis of Reduced RIPEMD-160, by Florian Mendel and Thomas Peyrin and Martin Schläffer and Lei Wang and Shuang Wu

  In this article, we propose an improved cryptanalysis of the double-branch hash function standard RIPEMD-160. Using a carefully designed non-linear path search tool, we study the potential differential paths that can be constructed from a difference in a single message word and show that some of these message words can lead to very good differential path candidates. Leveraging the recent freedom degree utilization technique from Landelle and Peyrin to merge two branch instances, we eventually manage to obtain a semi-free-start collision attack for 42 steps of the RIPEMD-160 compression function, while the previously best know result reached 36 steps. In addition, we also describe a 36-step semi-free-start collision attack which starts from the first step.



15:17 [Pub][ePrint] Two-round secure MPC from Indistinguishability Obfuscation, by Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova

  One fundamental complexity measure of an MPC protocol is its {\\em round complexity}. Asharov et al. recently constructed the first three-round protocol for general MPC in the CRS model. Here, we show how to achieve this result with only two rounds. We obtain UC security with abort against static malicious adversaries, and fairness if there is an honest majority. Additionally the communication in our protocol is only proportional to the input and output size of the function being evaluated and independent of its circuit size. Our main tool is indistinguishability obfuscation, for which a candidate construction was recently proposed by Garg et al.

The technical tools that we develop in this work also imply virtual black box obfuscation of a new primitive that we call a \\emph{dynamic point function}. This primitive may be of independent interest.



15:17 [Pub][ePrint] On the Efficacy of Solving LWE by Reduction to Unique-SVP, by Martin R. Albrecht and Robert Fitzpatrick and Florian G ̈opfert

  We present a study of the concrete complexity of solving instances of the unique shortest vector problem (uSVP). In particular, we study the complexity of solving the Learning with Errors (LWE) problem by reducing the Bounded-Distance Decoding (BDD) problem to uSVP and attempting to solve such instances using the \'embedding\' approach. We experimentally derive a model for the success of the approach, compare to alternative methods and demonstrate that for the LWE instances considered in this work, reducing to uSVP and solving via embedding compares favorably to other approaches.





2013-09-18
22:03 [Job][New] Tenure-track Assistant Professors , Florida State University, Tallahassee, Florida, Southern USA

  The Department of Computer Science at the Florida State University invites applications for multiple tenure-track Assistant Professor positions to begin August 2014. Positions are 9-mo, full-time, tenure-track, and benefits eligible. Outstanding applicants with strengths in the areas of Big Data and Cyber Security are particularly encouraged to apply. Outstanding applicants specializing in other emerging research areas are also welcome to apply. Applicants should hold a PhD in Computer Science or closely related field, and have excellent research and teaching accomplishments or potential. The department offers degrees at the BS, MS, and PhD levels. The department is an NSA/DHS Center of Academic Excellence in Information Assurance Education (CAE-IAE) and Research (CAE-R).

FSU is classified as a Carnegie Research I university. Its primary role is to serve as a center for advanced graduate and professional studies while emphasizing research and providing excellence in undergraduate education.

Screening will begin January 1, 2014 and will continue until the position is filled. Please apply online with curriculum vitae, statements of teaching and research philosophy, and the names of five references, at

http://www.cs.fsu.edu/positions/apply.html

Questions can be e-mailed to Prof. Mike Burmester, Faculty Search Committee Chair, recruitment (at) cs.fsu.edu or to Prof. Robert van Engelen, Department Chair, chair (at) cs.fsu.edu.

The Florida State University is a Public Records Agency and an Equal Opportunity/Access/Affirmative Action employer, committed to diversity in hiring.

13:32 [Job][New] Ph.D./Post-Docs, University of Haifa, Israel

  I am looking for a few excellent Ph.D. candidates (preferably with proven research capabilities) and post-docs in cryptography (mostly cryptanalysis of symmetric-key primitives), privacy (privacy of biometric databases/schemes) and computer security.

13:32 [Job][New] MSc Student, University of Warsaw, Poland, European Union

  An MSc position in the area of cryptography in the Cryptography and Data Security Group at the Department of Mathematics, Informatics and Mechanics at University of Warsaw is available. The position is supported by the EU FNP Welcome Grant \\\"Cryptographic Protocols Provably-Secure Against Physical Attacks\\\". This project is about the design of cryptographic schemes that are provably-secure against physical attacks, such as side-channel leakages, tampering, or malware intrusion. We offer excellent networking and training opportunities, including participation in international workshops and conferences.

Job profile: All candidates with background in theoretical computer science and mathematics are encouraged to apply and will be carefully considered. Knowledge of Polish is not required, but a good knowledge of English is essential.

Successful candidates can start from 10.2013. Funding is available until 5.2015 (extensions are possible depending on the funding availability)



13:32 [Job][New] PhD Student, University of Warsaw, Poland, European Union

  A PhD position in the area of cryptography in the Cryptography and Data Security Group at the Department of Mathematics, Informatics and Mechanics at University of Warsaw is available. The position is supported by the EU FNP Welcome Grant \\\"Cryptographic Protocols Provably-Secure Against Physical Attacks\\\". This project is about the design of cryptographic schemes that are provably-secure against physical attacks, such as side-channel leakages, tampering, or malware intrusion. We offer excellent networking and training opportunities, including participation in international workshops and conferences.

All candidates with background in theoretical computer science and mathematics are encouraged to apply and will be carefully considered. Knowledge of Polish is not required, but a good knowledge of English is essential.

Successful candidates can start from 10.2013. Funding is available until 5.2015 (extensions are possible depending on the funding availability)

Stipend: 3000 PLN / month

13:31 [Job][New] Post-Doc, University of Warsaw, Poland, European Union

  A post-doc position in the area of cryptography in the Cryptography and Data Security Group at the Department of Mathematics, Informatics and Mechanics at University of Warsaw is available. The position is supported by the EU FNP Welcome Grant \\\"Cryptographic Protocols Provably-Secure Against Physical Attacks\\\". This project is about the design of cryptographic schemes that are provably-secure against physical attacks, such as side-channel leakages, tampering, or malware intrusion. We offer excellent networking and training opportunities, including participation in international workshops and conferences.

All candidates with PhD in cryptography are encouraged to apply and will be carefully considered. Knowledge of Polish is not required, but a good knowledge of English is essential.

Successful candidates can start from 10.2013. Funding is available until 5.2015 (extensions are possible depending on the funding availability)



13:30 [Event][New] ACISP 2014: 19th Australasian Conference on Information Security and Privacy

  Submission: 23 February 2014
Notification: 13 April 2014
From July 7 to July 9
Location: Wollongong, Australia
More Information: https://ssl.informatics.uow.edu.au/acisp2014/




2013-09-15
00:17 [Pub][ePrint] Smashing MASH-1, by Vladimir Antipkin

  MASH-1 is modular arithmetic based hash function. It is presented in Part 4 of ISO/IEC 10118

standard for one and a half decade. Cryptographic strength of MASH-1 hash function is based on

factorization problem of an RSA modulus along with redundancy in the input blocks of compression

functions. Despite of this, we are able to introduce two large classes of moduli which allow

practical time collision finding algorithm for MASH-1. In one case even multicollisions of

arbitrary length can be constructed.



00:17 [Pub][ePrint] EyeDecrypt -- Private Interactions in Plain Sight, by Andrea Forte and Juan Garay and Trevor Jim and Yevgeniy Vahlis

  We introduce EyeDecrypt, a novel technology for privacy-preserving human-computer interaction. EyeDecrypt allows only authorized users to decipher data shown on a public display, such as an electronic screen or printed material; in the former case, the authorized user can then interact with the system (e.g., by pressing buttons), without revealing the details of the interaction to others who may be watching.

The user views data on a closely-held personal device, such as a pair of smart glasses with a camera and heads-up display, or a smartphone. The decrypted data is displayed as an image overlay on the personal device--a form of augmented reality. The user\'s inputs are protected through randomization.

EyeDecrypt consists of three main components: a visualizable encryption scheme; a dataglyph-based visual encoding scheme for the ciphertexts generated by the encryption scheme; and a randomized input and augmented reality scheme that protects user inputs without harming usability. We describe all aspects of EyeDecrypt, from security definitions, constructions and formal analysis, to implementation details of a prototype developed on a smartphone.