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

2011-08-30
20:28 [PhD][New] Gene Tsudik

  Gene Tsudik


20:28 [PhD][New] Emiliano De Cristofaro: Sharing Sensitive Information with Privacy

  Emiliano De Cristofaro
Sharing Sensitive Information with Privacy
cryptographic protocols

Modern society is increasingly dependent on (and fearful of) massive amounts and availability of electronic information. There are numerous everyday scenarios where sensitive data must be --- sometimes reluctantly or suspiciously --- shared between entities without mutual trust. This prompts the need for mechanisms to enable limited (privacy-preserving) information sharing. A typical scenario involves two parties: one seeks information from the other, that is either motivated, or compelled, to share only the requested information. We define this problem as privacy-preserving sharing of sensitive information and are confronted with two main technical challenges: (1) how to enable this type of sharing such that parties learn no information beyond what they are entitled to, and (2) how to do so efficiently, in real-world practical terms.

\r\n\r\nThis dissertation presents a set of efficient and provably secure cryptographic protocols for privacy-preserving sharing of sensitive information. In particular, Private Set Intersection (PSI) techniques are appealing whenever two parties wish to compute the intersection of their respective sets of items without revealing to each other [...]


13:46 [PhD][New] Nicky Mouha: Analysis and Design of Cryptographic Hash Functions

  Nicky Mouha
Analysis and Design of Cryptographic Hash Functions
secret-key cryptography



04:48 [Job][New] Ph.D. Scholarships, Queensland University of Technology, Brisbane, Australia

 

The Information Security Institute (ISI) at the Queensland University of Technology (QUT) in Brisbane, Australia, invites applications for PhD students starting in 2012 in the areas of cryptography, information security, and network security. ISI is a multi-disciplinary institute bringing together information security researchers from computer science, mathematics, engineering, business, and law, with a leading national profile and strong international links.

Students should have a background in computer science, mathematics, or engineering. QUT offers competitive scholarships for living expenses and tuition fee waivers to support domestic and international PhD students. Applications for admission are accepted year-round, but the deadline for the annual scholarship competition is Friday 14 October 2011.





2011-08-29
09:23 [PhD][New] Jens Hermans: Lightweight public-key cryptography

  Jens Hermans
Lightweight public-key cryptography
public-key cryptography



07:59 [Event][New] SCIS 2012: The 29th Symposium on Cryptography and Information Security

  Submission: 2 December 2011
From January 30 to February 2
Location: Kanazawa, Ishikawa, Japan
More Information: https://security-lab.jaist.ac.jp/scis2012/index_e.html




2011-08-28
17:54 [News] Message from the IACR Board to the Japanese cryptologic community

  We have been witnessing the dramatic consequences of the earthquake and tsunami in Japan of March 11; we are devastated about the loss of lives and homes. We sincerely hope that the Japanese members of the IACR, their relatives, friends, and colleagues will manage to cope with this disaster, and we wish them a lot of courage and strength. Our thoughts are with all of you.

17:53 [News] Message from the IACR Board w.r.t. CHES 2011

  The IACR board and the CHES steering committee are in close contact with the organizers of CHES 2011, which has been rescheduled for September 28-October 1 in Nara. We are all strongly committed to make CHES 2011 a success.

11:38 [Event][New] Is Cryptographic Theory Practically Relevant?

 



2011-08-27
23:05 [News][Book] Books Available for Review

  The following books are looking for a reviewer. If you want to review one of these, please contact Axel Poschmann via books/at/iacr.org. You find more information at http://www.iacr.org/books/booksForReview.html.

CRC Press/Taylor & Francis Group

New arrivals (2011-03-24):

  1. Liu: Security and Policy Driven Computing
  2. Stanoyevitch: Discrete Structures with Contemporary Applications

Available previously:

  1. Blanchet-Sadri: Algorithmic Combinatorics on Partial Words
  2. Brualdi: A Combinatorial Approach to Matrix Theory and Its Applications
  3. Chartrand: Chromatic Graph Theory
  4. Gross: Combinatorial Methods with Computer Applications
  5. Gould: Mathematics in Games, Sports, and Gambling
  6. Johnson: Handbook of Finite Translation Planes
  7. Lindner: Design Theory, Second Edition
  8. Moldovyan: Data-driven Block Ciphers for Fast Telecommunication Systems
  9. Paulsen: Abstract Algebra. An interactive Approach
  10. Peeva: Syzygies and Hilbert Functions
  11. Szabo: Factoring Groups into Subsets
  12. Thuraisingham: Secure Semantic Service-Oriented Systems
  13. Wallis: Introduction to Combinatorial Designs, Second Edition
  14. Xiao: Security in Distributed, Grid, Mobile, and Pervasive Computing

Springer

New arrivals (2011-03-24):

  1. Aycock: Spyware and Adware
  2. Bard: Algebraic Cryptanalysis
  3. Bauer: Origins and Foundations of Computing
  4. Böhme: Advanced Statistical Steganalysis
  5. Dietzfelbinger: Primality Testing in Polynomial Time
  6. Sadeghi: Towards Hardware-Intrinsic Security

Available previously:

  1. Adjeroh: The Burrows-Wheeler Transform
  2. Buchmann: Binary Quadratic Forms
  3. Camp: Economics of Identity Theft
  4. Dietzfelbinger: Primality Testing in Polynomial Time
  5. Di Pietro: Intrusion Detection Systems
  6. Fine: Number Theory
  7. Gomes: Implicit Curves and Surfaces: Mathematics, Data Structures, and Algorithms
  8. Hromkovic: Algorithmic Adventures
  9. Kuo: Precoding Techniques for Digital Communication Systems
  10. Li: An Introduction to Kolmogorov Complexity and Its Applications
  11. Mehlhorn: Algorithms and Data Structures
  12. Onieva: Secure Multi-Party Non-Repudiation Protocols and Applications
  13. Robshaw: New Stream Cipher Designs
  14. Rosen: Concurrent Zero-Knowledge
  15. Salomon: A Concise Introduction to Data Compression
  16. Sammes: Forensic Computing
  17. Schellekens: A Modular Calculus for the Average Cost of Data Structuring
  18. Shi: Transactions on Data Hiding and Multimedia Security III
  19. Traynor: Security for Telecommunications Networks
  20. Vöcking: Taschenbuch der Algorithmen [German]
  21. Yeung: Information Theory and Network Coding



20:03 [News][Review] New Book Reviews Available

  The following book reviews are now available:
  • Al Sakib Khan Pathan: "Security of Self-Organizing Networks", 2011.
    Publisher: CRC Press/Taylor & Francis Group. ISBN: 978-1-4398-1919-7
    Review written by S.V. Nagaraj (RMK Engineering College, Kavaraipettai, Tamil Nadu, India). (Date: 2011-08-16)

  • Mark S. Merkow and Lakshmikanth Raghavan: "Secure and Resilient Software Development", 2010.
    Publisher: CRC Press/Taylor & Francis Group. ISBN: 978-1-4398-2696-6
    Review written by Emin Islam Tatli (Daimler TSS, Germany). (Date: 2011-08-02)

  • Syed A. Ahson and Mohammad Ilyas: "Cloud Computing and Software Services - Theory and Techniques", 2011.
    Publisher: CRC Press/Taylor & Francis Group. ISBN: 978-1-4398-0315-8
    Review written by Dominik Birk (Horst Görtz Institute, Ruhr University Bochum, Germany). (Date: 2011-07-06)

  • Rowan Garnier and John Taylor: "Discrete Mathematics", 2010.
    Publisher: CRC Press/Taylor & Francis Group. ISBN: 978-1-4398-1280-8
    Review written by Gregory Kohring (Inversik Laboratories, Germany). (Date: 2011-07-01)

  • Nguyen and Vallee: "The LLL Algorithm", 2010.
    Publisher: Springer. ISBN: 978-3-642-02294-4
    Review written by Steven Galbraith (University of Auckland, New Zealand). (Date: 2011-07-01)