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-07-01
19:11 [PhD][New] Viet Tung Hoang: Foundations of garbled circuits

  Name: Viet Tung Hoang
Topic: Foundations of garbled circuits
Category: foundations

Description:

\r\nGarbled circuits, a classical idea rooted in the work of Andrew Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme. We provide a provable-security treatment for garbling schemes, endowing them with a versatile syntax and multiple security definitions. The most basic of these, privacy, suffices for two-party secure function evaluation (SFE) and private function evaluation (PFE). We next consider obliviousness and authenticity, properties needed for private and verifiable outsourcing of computation. Starting from a PRF, we give efficient schemes to achieve all security notions above, and analyze their concrete security. Our treatment of garbling schemes provides ground for more efficient garbling, more rigorous analyses, and more modularly designed higher-level protocols.\r\n

\r\nOn the practical side, we provide extremely efficient garbling schemes based on fixed-key AES. We justify the security of these methods in the random-permutation model, where parties have access to a public random permutation, and build the JustGarble system to implement them. JustGarble evaluates moderate-sized garbled circuits at an amortized cost of 23.2 cycles per gate (7.25 nsec), far faster than any prior reported results.\r\n

\r\nStandard constructions of garbling schemes, including ours, provide only static security, meaning the input x is not allowed to depend on the garbled circuit F. But some application—notably one-time programs (Goldwasser, Kalai, and Rothblum2008) and secure outsourcing (Gennaro, Gentry, Parno 2010)—need adaptive security, where x may depend on F. We identify gaps in proofs from these papers with regard to adaptive security, which signifies the absence of a good abstraction boundary. We then investigate adaptive security of garbling schemes, giving definitions encompassing privacy, authenticity, and obliviousness,[...]


19:10 [PhD][New] Phillip Rogaway: The Round Complexity of Secure Protocols

  Name: Phillip Rogaway
Topic: The Round Complexity of Secure Protocols
Category: foundations



13:54 [PhD][New] Jeroen Doumen: Some Applications of Coding Theory in Cryptography

  Name: Jeroen Doumen
Topic: Some Applications of Coding Theory in Cryptography


13:54 [PhD][New] Prof.dr.ir. H.C.A. van Tilborg

  Name: Prof.dr.ir. H.C.A. van Tilborg


13:47 [Event][New] FC14: Financial Cryptography and Data Security 2014

  Submission: 25 October 2013
Notification: 15 December 2013
From March 3 to March 7
Location: Rockley, Christ Church, Barbados
More Information: http://ifca.ai/fc14/index.html




2013-06-30
20:20 [Conf] Report on ICITS

 

6th International Conference on Information Theoretic Security (ICITS 2012)

ICITS 2012 was held from August 15 to 17, 2012 in Montréal (Canada). The organizing committee included Adam D. Smith (Program Chair), Jürg Wullschleger (General Chair), Alain Tapp, Claude Crépeau and Olivier Coutu.

It is a conference about all aspects of information-theoretic security. Its aim is to bring together researchers from all over the world from the areas of cryptography, information theory and quantum information. The conference was created as a successor of the “IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security” on Awaji Island, Japan, and takes place every 18 month, alternating between Asia, Europe and North America. Previous ICITS conferences were held in Madrid (Spain), Calgary (Canada), Shizuoka (Japan) and Amsterdam (The Netherlands).

As in previous ICITS conferences, the plenary talks were given by the leading researchers in the field. This year, these talks were given by Serge Fehr (CWI Amsterdam), Patrick Hayden (McGill University), Negar Kiyavash (University of Illinois at Urbana-Champaign), Xin Li (University of Washington), Krzysztof Pietrzak (IST Austria) and Salil Vadhan (Harvard University).

The usual process for conferences in Computer Science is that all submitted papers first undergo a careful reviewing process, and all papers that are accepted are not only presented at the conference, but they also appear in the conference’s proceedings. Previous ICITS conferences also used this format, but it turned out not to be optimal for information theorists and physicists. For this years ICITS, the organizers therefore decided to make a special “workshop track,” in addition to the more standard “conference track,” where the speakers needed to submit only a one-page abstract which will appear in the proceedings. This new format with both a conference and a workshop track was a big success, both in quality and quantity, and having as additional track also increased the number of participants.

The ICITS 2013 will take place in Singapore, from November 28 to 30, 2013.



20:16 [PhD][New] Yossef Oren: Secure Hardware - Physical Attacks and Countermeasures

  Name: Yossef Oren
Topic: Secure Hardware - Physical Attacks and Countermeasures
Category: implementation

Description: Any cryptographic functionality, such as encryption or authentication, must be implemented in the real world before it can be put to practical use. This implementation typically takes the form of either a software implementation for a general-purpose device such as a personal computer, or as a dedicated secure hardware device, whose main purpose is to embody the cryptographic functionality. Examples of such secure hardware devices include smart cards, car alarm key fobs and computerized ballots. To evaluate the security of a cryptographic system, researchers look for flaws which allow an attacker to break the security assumptions of the system (for example, allowing an unauthorized party to view or modify a message intended for someone else). Physical attacks (also called implementation attacks) compromise the system by taking advantage of the physical aspects of the algorithm\'s implementation. Some physical attacks (such as, for example, power analysis) recover the secret key used by the secure device by analyzing physical effects produced during its use; Others (such as, for example, relay attacks) disable or otherwise limit its secure behaviour by exploiting design or implementation flaws or by changing the underlying assumptions made by the designers of the system. \r\n
\r\nThis research focuses on physical attacks on secure hardware devices and on countermeasures which protect against these attacks. My goals were to investigate vulnerabilities in current secure hardware implementations and to evaluate the effectiveness of current and proposed countermeasures against these vulnerabilities. The two main tracks of my research are side-channel analysis (and explicitly power analysis) and secure RFID.\r\n
\r\nIn the side-channel analysis track, I investigated ways of reducing the data requirements of power analysis attacks. We showed how to mount key recovery attacks on a secure device using an extremely low amount of measurement data. The main novelty of our[...]


20:14 [PhD][New] David Peleg

  Name: David Peleg


20:14 [PhD][New] Avishai Wool: Quorum Systems for Distributed Control Protocols

  Name: Avishai Wool
Topic: Quorum Systems for Distributed Control Protocols
Category: foundations





2013-06-29
09:17 [Forum] [IACR Publication Reform] Re: Testable change by amitsahai

  Actually, what I was proposing is largely orthogonal to current "two-stage" review systems. My point was to have a system where authors and fellow PC members review the reviewers. Furthermore, this review would cause bad reviewers to lose the right to publish their own work at future top conferences. This would create (I think) a powerful incentive for reviewers to spend the time to craft better reviews -- at the very least, to understand better technically what is going on in a paper that they are supposed to be reviewing. -- Finally, coming back to the points raised in this thread about multi-stage reviews: At TCC 2013 this year, we tried out a system which allowed for *freeform* interaction between PC members and authors (i.e. a "poly-stage" review process). In my opinion as the PC chair with a global view of what happened, this interaction was extremely helpful, especially with papers that were "on the edge", or were misunderstood during the review process. --Amit From: 2013-29-06 06:34:34 (UTC)



2013-06-28
21:35 [Event][New] PKC 2014: 17th International Conference on Practice and Theory of Public-Key

  Submission: 4 October 2013
Notification: 16 December 2013
From March 26 to March 28
Location: Buenos Aires, Argentina
More Information: http://www.iacr.org/workshops/pkc2014/