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-06-07
18:17 [Pub][ePrint] On the Security of the TLS Protocol: A Systematic Analysis, by Hugo Krawczyk and Kenneth G. Paterson and Hoeteck Wee

  TLS is the most widely-used cryptographic protocol on the Internet. It comprises the TLS Handshake Protocol, responsible for authentication and key establishment, and the TLS Record Protocol, which takes care of subsequent use of those keys to protect bulk data. TLS has proved remarkably stubborn to analysis using the tools of modern cryptography. This is due in part to its complexity and its flexibility. In this paper, we present the most complete analysis to date of the TLS Handshake protocol and its application to data encryption (in the Record Protocol). We show how to extract a key-encapsulation mechanism (KEM) from the TLS Handshake Protocol, and how the security of the entire TLS protocol follows from security properties of this KEM when composed with a secure authenticated encryption scheme in the Record Protocol. The security notion we achieve is a variant of the ACCE notion recently introduced by Jager et al. (Crypto \'12). Our approach enables us to analyse multiple different key establishment methods in a modular fashion, including the first proof of the most common deployment mode that is based on RSA PKCS #1v1.5 encryption, as well as Diffie-Hellman modes. Our results can be applied to settings where mutual authentication is provided and to the more common situation where only server authentication is applied.





2013-06-06
09:30 [Conf][Crypto] Report on SAC 2012

 

The Conference on the Selected Areas in Cryptography in 2012 (SAC 2012) was held at University of Windsor, Windsor, Canada on August 15-16, 2012.

SAC 2012 received 87 submissions. Each submission was reviewed by at least three reviewers. 24 papers were selected for publication in the proceedings and acceptance rate was 24/87=27.6%. Two invited talks were given by Vincent Rijmen (KU Leuven) and Ian Goldberg (University of Waterloo) on the topics "Extracts from the SHA-3 competition" and "Privacy Enhancing Technologies for the Internet", respectively.

A digital version of the pre-proceedings was provided to the 55 attendees. Revised versions of the accepted papers were published in the LNCS 7707 by Springer. Most presentation slides for the technical sessions including the invited talks can be found on the conference website at http://www.uwindsor.ca/sac2012/.

The program co-chairs were Lars R. Knudsen and Huapeng Wu, who wish to thank the sponsors of SAC 2012, including the Vice President (Research) Office, Faculty of Engineering, and the Department of Electrical and Computer Engineering, University of Windsor for their enthusiastic and generous support.



03:47 [Event][New] PQCrypto 2014: 6th International Conference on Post-Quantum Cryptography

  From October 1 to October 3
Location: Waterloo, Canada
More Information: http://pqcrypto2014.uwaterloo.ca




2013-06-04
16:48 [Conf][Crypto] Report on Crypto 2012

 

Crypto 2012 was held August 19-23 on the beautiful campus of the University of California, Santa Barbara. The Program Co-chairs were Rei Safavi-Naini and Ran Canetti, and the General Chair was Yiqun Lisa Yin.

A total of 225 papers were submitted, and 48 were accepted for publication, a record number for IACR flagship conferences. For the Best Paper Award, the PC overwhelmingly selected “Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks and Combinatorial Search Problems” by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir.

There were two invited talks and one tutorial session at the conference. Professor Jonathan Zittrain from Harvard gave a talk entitled “The End of Crypto”. Dr. Ernie Brickell from Intel spoke about “Recent Advances and Existing Research Questions in Platform Security”. Professor Adam Smith from Penn State delivered a tutorial on “Pinning Down ‘Privacy’ in Statistical Databases”. Dan Bernstein and Tanja Lange co-chaired yet another entertaining Rump Session. Almost all of the talks were video recorded. These videos, along with author's slides and full versions of the papers, are available on the conference program webpage.

Generous donations were given by five industry sponsors Google, Microsoft Research, Qualcomm, RIM, and Voltage Security, as well as the Marconi Fund. In addition, the conference applied and received a special funding of $10,000 from the National Science Foundation (NSF). With all the financial support, stipends were offered to over 40 students, both domestic and international.

The Chairs of Crypto 2012 were very grateful for the wonderful work of Sally Vito and the UCSB conference services staff.



12:36 [Pub] IACR Publication Reform - Open Discussion

  At the ePrint forum (http://eprint.iacr.org/forum/list.php?14), there is currently a discussion going on about possible changes to the IACR publication system.
Some of the latest postings:
  • Assigning Papers to Talks (cbw)
  • Some issues + Counter proposal (Orr)
  • Change is needed, but slow change is important (lindell)
  • How to handle resubmissions? (ivandamgard)
  • Questions (nigel)
You can access the full text at the link given above.
In case you want to contribute, you need to request a login/password via the same link.


08:53 [Conf] Report on Inscrypt 2012

 

Inscrypt 2012, Nov. 28-30, 2012 in Beijing, China

The 8th China International Conference on Information Security and Cryptology was held at Beijing International Convention Center, Nov. 28 - Nov. 30, 2012, Beijing, China. See http://www.inscrypt.cn/2012/ for the web-site.

The program co-chairs were Miroslaw Kutylowski and Moti Yung, and the general chair was Dongdai Lin. Inscrypt 2012 received 73 submissions from 24 countries, and 23 were selected for presentation at the conference. These accepted papers, after revision, appeared in the conference post-proceeding which was published as Lecture Notes in Computer Science vol. 7763.

Two invited talks were given by Jung Hee Cheon (Seoul National University) and Goichiro Hanaoka (AIST) on the topics "Open Questions for the Discrete Logarithm" and "Toward Shorter Ciphertext in ElGamal-type CCA-secure Public Key Encryption", respectively. Additionally, the conference was featured with two tutorials given by Junfeng Fan (KU Leuven) and Miroslaw Kutylowski (Wroclaw University of Technology) on the topics "Cryptographic hardware: design for low power, low area and security against physical attacks" and "Electronic Personal Identity Documents", respectively.

The conference banquet was a traditional Chinese one, with Chinese rice wine (Baijiu) served. The registration fee was 450 USD for regular and 350 USD for full-time student. About 90 attendees enjoyed the 3-day conference sessions and Beijing in winter.



08:48 [Conf] Report on TCC 2012

 

The 9th IACR Theory of Cryptography Conference (TCC'12) was held at the Hotel "Villa Diodoro" in Taormina, Italy, on March 19-21, 2012. The organizing committee included Rosario Gennaro and Nelly Fazio (General Co-chairs) and Dario Catalano (Local Arrangements Chair).

The technical program featured 36 papers selected from 131 submissions, along with two invited lectures: "Locally Decodable Codes" by Sergey Yekhanin of Microsoft Research and "Non-Interactive Zero-Knowledge" by Jens Groth of the University College of London. The program was assembled by a 20-member Program Committee led by Ronald Cramer as Program Chair.

The conference attracted 108 delegates, including 29 students of which 16 were given financial aid to attend the conference in the form of free registration and free housing.

The generous financial support of the conference sponsors (Bell Labs, IBM Research, Microsoft, AT&T and Oxford University Press) was also an important factor for the success of the event, and is gratefully acknowledged.

This was the first IACR workshop or conference where printed proceedings were optional, and had to be ordered at the time of registration for an extra fee of $50. Conference delegates received an electronic copy of the proceedings stored on a USB stick which was donated by DEShaw.



08:42 [Job][New] Research fellow in computer security, University of Bergen, Norway, EEA

 

The Department of Informatics has a vacancy for 2 research fellows (PhD positions) in computer security for a period of 4 years. The recruited students will work in a new research group, named Simula@UiB, that is headed by Professor Kjell Jørgen Hole. The group is a joint venture between Simula Research Laboratory (http://simula.no) and University of Bergen. It currently consists of two professors, two research scientists, one PhD student and several master students.

Candidates must have good analytical skills and be able to generate their own research ideas. They must have good communication skills and be fluent in English. Experience in computer security is an advantage. Candidates with experience from one or more of the areas Cyber Security, Software Security, Network Science, Game Theory, or Information Theory are of special interest.

In total, the fellowship period is 4 years. For positions with a 4-year duration 25 pct of the period will be designated to teaching and/or administrative duties. The fellowship period may be reduced if the successful applicant has held previous employment as research fellow or similar.



08:33 [Event][New] Pairing 2013: The 6th International Conference on Pairing-Based Cryptography

  Submission: 20 August 2013
Notification: 1 October 2013
From November 22 to November 24
Location: Beijing, People's Republic of China
More Information: http://www.pairing-conference.org/




2013-06-03
15:17 [Pub][ePrint] A method for obtaining lower bounds on the higher order nonlinearity of Boolean function, by Mikhail S. Lobanov

  Obtainment of exact value or high lower bound on the $r$-th order nonlinearity of Boolean function is a very complicated problem (especial if $r > 1$). In a number of papers lower bounds on the $r$-th order nonlinearity of Boolean function via its algebraic immunity were obtain for different $r$. This bounds is rather high for function with maximum near maximum possible algebraic immunity. In this paper we prove theorem, which try to obtain rather high lower bound on the $r$-th order nonlinearity for many functions with small algebraic immunity.



15:17 [Pub][ePrint] Double-authentication-preventing signatures, by Bertram Poettering and Douglas Stebila

  Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a certain piece of information existed at a certain time. Traditional digital signature schemes however impose no uniqueness conditions, so a malicious or coerced authority can make multiple certifications for the same subject but different objects. We propose the notion of a \\emph{double-authentication-preventing signature}, in which a value to be signed is split into two parts: a \\emph{subject} and a \\emph{message}. If a signer ever signs two different messages for the same subject, enough information is revealed to allow anyone to compute valid signatures on behalf of the signer. This double-signature forgeability property prevents, or at least strongly \\emph{discourages}, signers misbehaving. We give a generic construction using a new type of trapdoor functions with extractability properties, which we show can be instantiated using the group of sign-agnostic quadratic residues modulo a Blum integer.