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

You can also access the full news archive.

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

2011-10-13
06:38 [PhD][New]

Name: Mehmet Sabir Kiraz
Topic: Secure and Fair Two-Party Computation
Category: cryptographic protocols

Description: Consider several parties that do not trust each other, yet they wish to correctly compute\r\nsome common function of their local inputs while keeping these inputs private. This\r\nproblem is known as “Secure Multi-Party Computation”, and was introduced by Andrew\r\nYao in 1982. Secure multi-party computations have some real world examples like electronic\r\nauctions, electronic voting or Fingerprinting. In this thesis we consider the case where there\r\nare only two parties involved. This is known as “Secure Two-Party Computation”.\r\nIf there is a trusted third party called Carol, then the problem is pretty straightforward.\r\nThe participating parties could hand their inputs in Carol who can compute the common\r\nfunction correctly and could return the outputs to the corresponding parties. The goal is\r\nto achieve (almost) the same result when there is no trusted third party.\r\nCryptographic protocols are designed in order to solve these kinds of problems. These\r\nprotocols are analyzed within an appropriate model in which the behavior of parties is\r\nstructured. The basic level is called the Semi-Honest Model where parties are assumed to\r\nfollow the protocol specification, but later can derive additional information based on the\r\nmessages which have been received so far. A more realistic model is the so-called Malicious\r\nModel. The common approach is to First analyze a protocol in the semi-honest model and\r\nthen later extend it into the malicious model.\r\nAny cryptographic protocol for secure two-party computation must satisfy the following\r\nsecurity requirements: correctness, privacy and fairness. It must guarantee the correctness\r\nof the result while preserving the privacy of the parties’ inputs, even if one of the parties is\r\nmalicious and behaves arbitrarily throughout the protocol. It must also guarantee fairness.\r\nThis roughly means that whenever a party aborts the protocol prematurely, he or she should\r\nnot have any advanta[...]

06:37 [PhD][New]

Name: Berry Schoenmakers

2011-10-12
06:53 [Job][New]

Temasek Laboratories at National University of Singapore, Singapore is looking for research scientist on Boolean functions especially on algebraic immunity.

Applicants should have a PhD degree in Mathematics/Computer Science or related discipline, have knowledge in Magma and programming proficiency in C/C++.

Review of applications will begin immediately.

For application information, please visit http://www.temasek-lab.nus.edu.sg/career/career.php. Interested candidates can contact Dr Tan Chik How tsltch (at) nus.edu.sg.

05:50 [Event][New]

Submission: 9 January 2012
From June 4 to June 8

2011-10-11
12:28 [Event][New]

Submission: 19 April 2012
From September 5 to September 7
Location: Amalfi, Italy

2011-10-10
12:15 [Event][Update]

Submission: 5 January 2012
From July 10 to July 12
Location: Marrakech, Morocco

2011-10-07
19:45 [Election]

For the ongoing election of 3 directors of the IACR, a total of 225 votes have been cast in the first week. This is equivalent to 15.2% of the 1484 eligible voters. The election is open until November 15,2011. For comparison: In 2010, a total of 30,5% of votes were cast in the whole election (6 weeks).

13:16 [Job][Update]

Description: Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw is looking for an MSc students to work on the project \\\"Cryptographic Protocols Provably-Secure Against Physical Attacks\\\" (http://crypto.mimuw.edu.pl/Welcome/). The project is founded by the Foundation for Polish Science \\\"Welcome\\\" programme operated within the Innovative Economy Operational Programme 2007-2013. The ideal candidate should be familiar with the probability theory, computational complexity, algebra, and number theory. The knowledge of cryptography and information theory is a plus, but is not a prerequisite. The student can work both on the theoretical aspects of the project, and on the practical implementations.

Duration: 2 years, starting date: 1.11.2011 (or later)

Formal requirement: while participating in the project the student should be enrolled to the MSc-level studies at some Polish university.

13:12 [Job][New]

MSc student (University of Warsaw),

Description: Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw is looking for an MSc students to work on the project \"Cryptographic Protocols Provably-Secure Against Physical Attacks\" (http://crypto.mimuw.edu.pl/Welcome/). The project is founded by the Foundation for Polish Science \"Welcome\" programme operated within the Innovative Economy Operational Programme 2007-2013. The ideal candidate should be familiar with the probability theory, computational complexity, algebra, and number theory. The knowledge of cryptography and information theory is a plus, but is not a prerequisite. The student can work both on the theoretical aspects of the project, and on the practical implementations.

Duration: 2 years, starting date: 1.11.2011 (or later)

Formal requirement: while participating in the project the student should be enrolled to the MSc-level studies at some Polish university.

2011-10-06
06:20 [Event][New]

Submission: 30 March 2012