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

2014-03-19
22:30 [Event][New] Crypto: Crypto 2018 (tentative)

  From August 19 to August 23
Location: Santa Barbara, USA
More Information: http://www.iacr.org/conferences/


20:50 [PhD][Update] Diego F. Aranha: Efficient software implementation of elliptic curves and bilinear pairings

  Name: Diego F. Aranha
Topic: Efficient software implementation of elliptic curves and bilinear pairings
Category:implementation

Description:

The development of asymmetric or public key cryptography made possible new applications of cryptography such as digital signatures and electronic commerce. Cryptography is now a vital component for providing confidentiality and authentication in communication infra-structures. Elliptic Curve Cryptography is among the most efficient public-key methods because of its low storage and computational requirements. The relatively recent advent of Pairing-Based Cryptography allowed the further construction of flexible and innovative cryptographic solutions like Identity-Based Cryptography and variants. However, the computational cost of pairing-based cryptosystems remains significantly higher than traditional public key cryptosystems and thus an important obstacle for adoption, specially in resource-constrained devices.

The main contributions of this work aim to improve the performance of curve-based cryptosystems, consisting of:
(i) efficient implementation of binary fields in 8-bit microcontrollers embedded in sensor network nodes;
(ii) efficient formulation of binary field arithmetic in terms of vector instructions present in 64-bit architectures, and on the recently-introduced native support for binary field multiplication in the latest Intel microarchitecture families;
(iii) techniques for serial and parallel implementation of binary elliptic curves and symmetric and asymmetric pairings defined over prime and binary fields.
These contributions produced important performance improvements and, consequently, several speed records for computing relevant cryptographic algorithms in modern computer architectures ranging from embedded 8-bit microcontrollers to 8-core processors.

[...]


20:28 [Event][New]

 



2014-03-18
15:17 [Pub][ePrint]

 

09:04 [PhD][New] Diego F. Aranha: Efficient software implementation of elliptic curves and bilinear pairings

  Name: Diego F. Aranha
Topic: Efficient software implementation of elliptic curves and bilinear pairings
Category: implementation

Description:

The development of asymmetric or public key cryptography made possible new applications of cryptography such as digital signatures and electronic commerce. Cryptography is now a vital component for providing confidentiality and authentication in communication infra-structures. Elliptic Curve Cryptography is among the most efficient public-key methods because of its low storage and computational requirements. The relatively recent advent of Pairing-Based Cryptography allowed the further construction of flexible and innovative cryptographic solutions like Identity-Based Cryptography and variants. However, the computational cost of pairing-based cryptosystems remains significantly higher than traditional public key cryptosystems and thus an important obstacle for adoption, specially in resource-constrained devices.\r\n

\r\nThe main contributions of this work aim to improve the performance of curve-based cryptosystems, consisting of:
(i) efficient implementation of binary fields in 8-bit microcontrollers embedded in sensor network nodes;
(ii) efficient formulation of binary field arithmetic in terms of vector instructions present in 64-bit architectures, and on the recently-introduced native support for binary field multiplication in the latest Intel microarchitecture families;
(iii) techniques for serial and parallel implementation of binary elliptic curves and symmetric and asymmetric pairings defined over prime and binary fields. \r\n
\r\nThese contributions produced important performance improvements and, consequently, several speed records for computing relevant cryptographic algorithms in modern computer architectures ranging from embedded 8-bit microcontrollers to 8-core processors.

[...]


09:03 [PhD][New]

 

09:02 [PhD][New]

 

08:50 [Event][New] SPACE 2014: 4th International Conference on Security, Privacy, and Applied Cryptography

  Submission: 1 June 2014
Notification: 11 July 2014
From October 18 to October 22
Location: Pune, India
More Information: http://cse.iitkgp.ac.in/conf/SPACE2014/#


00:17 [Pub][ePrint]

 

00:17 [Pub][ePrint]

 

00:17 [Pub][ePrint] From Input Private to Universally Composable Secure Multiparty Computation Primitives, by Dan Bogdanov and Peeter Laud and Sven Laur and Pille Pullonen

  Secure multiparty computation systems are commonly built form a small set of primitive components. Composability of security notions has a central role in the analysis of such systems, since it allows us to deduce security properties of complex protocols from the properties of its components. We show that the standard notions of universally composable security are overly restrictive in this context and can lead to protocols with sub-optimal performance. As a remedy, we introduce a weaker notion of privacy that is satisfied by simpler protocols and is preserved by composition. After that we fix a passive security model and show how to convert a private protocol into a universally composable protocol. As a result, we obtain modular security proofs without performance penalties.