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

2012-09-20
06:58 [Job][New] two PhD positions, University of Luxembourg

  ****2 Ph.D. Positions in Computer Security (Ref: SNT-PhD-STAST-0512)****

The University of Luxembourg has two open Ph.D. positions at its

Interdisciplinary Centre for Security, Reliability and Trust (SnT)

(http://wwwen.uni.lu/snt). We are seeking Ph.D. candidates to

participate in the activities of the SaToSS

(http://satoss.uni.lu/) and of the ApSIA (http://apsia.gforge.uni.lu/)

research groups.

Project description:

----------------------

The main objective of the Ph.D. project is to develop a formal

framework supporting modeling and analysis of socio-technical

components of information systems. We aim to develop strategies and

tools to detect and prevent attacks involving human, physical and

digital elements. One of the goals is to extend current methodology

for security protocol analysis, by taking human behavior and

properties of physical objects into account. This goal includes a

necessity of defining appropriate adversary models and identifying the

security properties relevant in a socio-technical context.

Applicant\'s profile:

--------------------

* MSc in Computer Science or Mathematics

* A proven interest in security

* Strong background in formal methods or logics

* Good written and oral English skills

Start date: As soon as possible



06:57 [Job][New] Tenure track Assistant Professor, Digital Security, Radboud University Nijmegen

  The Digital Security group at the Radboud University Nijmegen has a

vacancy for a full-time assistant professorship (Universitair Docent

UD in Dutch).

General information

Research in the group covers a range of topics including correctess

and security of software, smartcards and RFID, design and analysis of

security protocols, applied crypto, privacy and anonimity, quantum

logic and computing. Members of the group are also active in the

broader societal issues surrounding security & privacy, and regulary

carry out commercial contract research to apply and inspire high

quality academic research.

The group runs a joint Master programme in Computer Security in

collaboration with the universities of Twente and Eindhoven, named the

Kerckhoffs Institute (www.kerckhoffs-institute.org). In Nijmegen the

Institute for Computing and Information Sciences runs Bachelor and

Master courses in Computer Science (Informatica) and Information

Science (Informatiekunde).

For this position we are looking for the best candidate in the broader

field of security, who can be a good addition to the group and has

good synergy with ongoing research in the group, who is a team player,

and who can teach computer security to a broad range of students.





2012-09-15
00:17 [Pub][JoC] Enhancements of Trapdoor Permutations

 

Abstract  We take a closer look at several enhancements of the notion of trapdoor permutations. Specifically, we consider the notions of enhanced trapdoor permutation (Goldreich, Foundation of Cryptography: Basic Applications, 2004) and doubly enhanced trapdoor permutation (Goldreich, Computational Complexity: A Conceptual Perspective, 2011) as well as intermediate notions (Rothblum, A Taxonomy of Enhanced Trapdoor Permutations, 2010). These enhancements arose in the study of Oblivious Transfer and NIZK, but they address natural concerns that may arise also in other applications of trapdoor permutations. We clarify why these enhancements are needed in such applications, and show that they actually suffice for these needs.

  • Content Type Journal Article
  • Pages 1-29
  • DOI 10.1007/s00145-012-9131-8
  • Authors

    • Oded Goldreich, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel
    • Ron D. Rothblum, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    • Journal Journal of Cryptology
    • Online ISSN 1432-1378
    • Print ISSN 0933-2790

From: Wed, 12 Sep 2012 16:02:54 GMT




2012-09-12
21:47 [Election] Nomination now open

  2012 Election

The 2012 election is being held to fill three of nine IACR Director positions. The election will again be run electronically and further information will be available on the IACR website.

Nominations Are Now Open

Nominations are due by September 25, 2012.

A nomination form is available at http://www.iacr.org/elections/2012/IACR_2012_Election_Nomination_Form.pdf.

Election of Directors

The three directors whose terms are expiring are

  • Thomas Berson
  • David Naccache
  • Serge Vaudenay

Election Committee

  • Josh Benaloh (Chair)
  • David Pointcheval (Returning Officer)
  • Greg Rose




2012-09-11
16:48 [Event][New] MCCCC26: 26th Midwest Conference on Combinatorics, Cryptography and Computing

  Submission: 12 September 2012
From October 11 to October 13
Location: Cedar City, Utah, USA
More Information: http://www.suu.edu/cose/math/mcccc26/index.html


16:47 [Event][New] JSC: Journal of Symbolic Computation

  Submission: 30 November 2012
Notification: 30 March 2013
From November 30 to March 30
More Information: http://scc2012.unican.es/program.html


16:46 [Event][New] ICIEIS2013: The Second International Conference on Informatics Engineering & Informatio

  Submission: 1 August 2013
Notification: 20 August 2013
From November 12 to November 14
Location: Kuala Lumpur, Malaysia
More Information: http://sdiwc.net/conferences/2013/icieis2013/


16:45 [Job][New] Post-Doc in Security and Privacy, Saarland University, Germany

 

The Language-based Security (LBS) group (www.lbs.cs.uni-saarland.de) in the Computer Science Department of Saarland University is looking for postdoctoral researchers in security and privacy. The LBS group is part of the newly established Center for IT-Security, Privacy and Accountability (CISPA). CISPA actively supports collaborations with other research centers worldwide, and offers young researchers an ideal working environment. The close connection of CISPA to the Department of Computer Science, the Max-Planck-Institute (MPI) for Informatics, the MPI for Software Systems, the German Research Center for Artificial Intelligence (DFKI), the Cluster of Excellence on Multimodal Computing and Interaction (MMCI), the Saarbruecken Graduate School of Computer Science, and the Intel Visual Computing Institute (IVCI) is crucial for the success of the location. All of these institutes are in close proximity on the campus.

Topics of particular interest include, but are not limited to:

  • language-based security
  • cryptographic protocols
  • formal methods for security
  • web security
  • privacy enhancing technologies
  • reliability, accountability, and trust

Positions are initially offered for two years with an internationally competitive salary.

Applicants must hold a first degree in Computer Science, Mathematics or a related discipline, and have completed, or be near completion of a PhD degree in Computer Science or a closely related area. We expect successful applicants to have a strong background in one or more of the aforementioned research topics and to maintain an outstanding academic track record. The working and teaching language is English.

Applications should contain a CV, a publication list, a research statement, and the names of at least two references. Please send your applicat

16:45 [Job][New] PhD Studentship in Zero-Knowledge Proofs, University College London, United Kingdom

 

Zero-knowledge proofs enable a prover to convince a verifier that a statement is true without revealing any other information and are widely used in cryptographic protocols. The goal of the PhD studentship under the supervision of Dr Jens Groth is to develop new and more efficient zero-knowledge techniques. The project is expected to involve both theoretical research and practical work on implementing protocols.

Prospective candidates should have a strong undergraduate degree or masters in mathematics or computer science. The PhD studentship is funded by an ERC Starting Grant on Efficient Cryptographic Arguments and Proofs with a flexible starting date and duration of 4 years. The studentship will provide a tax-free annual stipend of £19,790, however, ERC funding does not cover student fees (currently £4,200 for UK/EU students and £19,250 for Overseas students).

University College London is one of Europe\\\'s highest ranked universities and has recently been recognized by the EPSRC and GCHQ as one of UK\\\'s Academic Centres of Excellence in Cyber Security Research. The Computer Science Department is one of the largest in the UK and is located at UCL\\\'s main campus in the centre of London.





2012-09-10
00:17 [Pub][JoC] An Efficient State Recovery Attack on the X-FCSR Family of Stream Ciphers

 

Abstract  We describe a state recovery attack on the X-FCSR family of stream ciphers. In this attack we analyse each block of output keystream and try to solve for the state. The solver will succeed when a number of state conditions are satisfied. For X-FCSR-256, our best attack has a computational complexity of only 24.7 table lookups per block of keystream, with an expected 244.3 such blocks before the attack is successful. The precomputational storage requirement is 233. For X-FCSR-128, the computational complexity of our best attack is 216.3 table lookups per block of keystream, where we expect 255.2 output blocks before the attack comes through. The precomputational storage requirement for X-FCSR-128 is 267.

  • Content Type Journal Article
  • Pages 1-22
  • DOI 10.1007/s00145-012-9130-9
  • Authors

    • Paul Stankovski, Dept. of Electrical and Information Technology, Lund University, P.O. Box 118, 221 00 Lund, Sweden
    • Martin Hell, Dept. of Electrical and Information Technology, Lund University, P.O. Box 118, 221 00 Lund, Sweden
    • Thomas Johansson, Dept. of Electrical and Information Technology, Lund University, P.O. Box 118, 221 00 Lund, Sweden

    • Journal Journal of Cryptology
    • Online ISSN 1432-1378
    • Print ISSN 0933-2790

From: Fri, 07 Sep 2012 16:46:28 GMT




2012-09-08
15:17 [Pub][ePrint] An ID-Based Signcryption Scheme with Compartmented Secret Sharing for Unsigncryption, by Graham Enos and Yuliang Zheng

  In this paper the ID-based signcryption scheme of Li, Xin, and Hu is extended to a compartmented scheme. If an organization is partitioned into different compartments, this scheme allows any member of a specific compartment to participate in the unsigncryption; moreover, each mem- ber of a compartment has information unique to that individual. This construction is the first (to the authors\' knowledge) to combine identity-based encryption, Shamir\'s threshold scheme, and signcryption into an implementable compartmented sharing scheme.