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-08-21
03:17 [Pub][ePrint] When Private Set Intersection Meets Big Data: An Efficient and Scalable Protocol, by Changyu Dong and Liqun Chen and Zikai Wen

  Large scale data processing brings new challenges to the design of privacy-preserving protocols: how to meet the increasing requirements of speed and throughput of modern applications, and how to scale up smoothly when data being protected is big. Efficiency and scalability become critical criteria for privacy preserving protocols in the age of Big Data. In this paper, we present a new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols. The protocol is based on a novel approach that we call oblivious Bloom intersection. It has linear complexity and relies mostly on efficient symmetric key operations. It has high scalability due to the fact that most operations can be parallelized easily. The protocol has two versions: a basic protocol and an enhanced protocol, the security of the two variants is analyzed and proved in the semi-honest model and the malicious model respectively. A prototype of the basic protocol has been built. We report the result of performance evaluation and compare it against the two previously fastest PSI protocols. Our protocol is orders of magnitude faster than these two protocols. To compute the intersection of two million-element sets, our protocol needs only 41 seconds (80-bit security) and 339 seconds (256-bit security) on moderate hardware in parallel mode.



03:17 [Pub][ePrint] MAC Schemes with Efficient Protocols and Keyed-Verification Anonymous Credentials, by Melissa Chase and Gregory M. Zaverucha

  We consider the problem of constructing anonymous credentials for use in a setting where the issuer of credentials is also the verifier, or where the issuer and verifier have a shared key. In this setting we can use message authentication codes (MACs) instead of public key signatures as the basis of the credential system.

To this end, we construct two algebraic MAC schemes in prime order groups, along with efficient protocols for issuing credentials, asserting possession a credential, and proving statements about the attributes.Security of the first scheme is proven in the generic group model, and we show that the second is secure under the decisional Diffie-Hellman (DDH) assumption, using a dual system-based approach.

Finally, we compare the efficiency of our new systems to two traditional credential systems, U-Prove and Idemix. We show that performance of the new schemes are competitive with U-Prove, and many times faster than Idemix. This brings together the best aspects of these two existing systems: the efficiency of U-Prove combined with the multi-show unlinkability of Idemix.



03:17 [Pub][ePrint] Improvement of One Adaptive Oblivious Transfer Scheme , by Zhengjun Cao and Lihua Liu

  In 2011, the authors [8] presented an adaptive oblivious transfer (OT) scheme based on Decisional 3-Party Diffie-Hellman (3DDH) assumption. The encryption used in the scheme is a combination of the Boneh-Boyen IBE scheme and a variation of the Hohenberger-Waters signature. The scheme is somewhat inefficient since it combines the two underlying schemes in a simple way. In this paper, we present an improvement of the OT scheme and show its security under 3DDH assumption. The proposed skills are helpful for designing and analyzing other cryptographic schemes.



03:17 [Pub][ePrint] Universal Leaky Random Oracle Model, by Guangjun Fan and Yongbin Zhou and Dengguo Feng

  K.Yoneyama et al. introduces the Leaky Random Oracle Model at ProvSec2008, which only considers the leakage of the hash list of a hash function used by a cryptosystem due to various attacks caused by implementation or sloppy usages. However, an important fact is that such attacks not only leak the hash list of a hash function, but also leak other secret states outside the hash list of a cryptosystem (e.g. the secret key). In most cases, an adversary may be more interesting in revealing these secret states. Therefore, the Leaky Random Oracle Model is very limited because it only considers the leakage of the hash list and does not consider the leakage of other secret states. In this paper, we present a new leakage model based on the Leaky Random Oracle Model. In our new model, both the secret states (secret key) and the hash list can be leaked. Furthermore, the secret key can be leaked continually. Hence, our new model is more universal and stronger than the Leaky Random Oracle Model and some other leakage models. Furthermore, we give a provable security public key encryption scheme which is IND-CCA secure in our new model.



03:17 [Pub][ePrint] Montgomery Multiplication Using Vector Instructions, by Joppe W. Bos and Peter L. Montgomery and Daniel Shumow and Gregory M. Zaverucha

  In this paper we present a parallel approach to compute interleaved Montgomery multiplication. This approach is particularly suitable to be computed on 2-way single instruction, multiple data platforms as can be found on most modern computer architectures in the form of vector instruction set extensions. We have implemented this approach for tablet devices which run the x86 architecture (Intel Atom Z2760) using SSE2 instructions as well as devices which run on the ARM platform (Qualcomm MSM8960, NVIDIA Tegra 3 and 4) using NEON instructions. When instantiating modular exponentiation with this parallel version of Montgomery multiplication we observed a performance increase of more than a factor of 1.5 compared to

the sequential implementation in OpenSSL for the classical arithmetic logic unit on the Atom platform for 2048-bit moduli.





2013-08-20
15:40 [Service] Free Access to IACR Publications at Springer

  IACR and Springer are pleased to offer you free access to the Journal of Cryptology and the IACR proceedings volumes for CRYPTO, EUROCRYPT, ASIACRYPT, FSE, CHES, PKC, and TCC. Simply use the links below to access these publications.

15:31 [News] Clarification on the new IACR publication and copyright policy

  HTML version

15:03 [Event][New] CT-RSA '14: Cryptographers' Track at the RSA Conference

  Submission: 5 September 2013
Notification: 31 October 2013
From February 24 to February 28
Location: San Francisco, USA
More Information: http://research.microsoft.com/en-us/um/redmond/events/CT-RSA-2014/cfp.htm


15:00 [Job][Update] 1 Post-Doc position in Privacy-preserving biometrics , Chalmers University of Technology, Sweden

  We are looking for an excellent, motivated, self-driven post-doctoral researcher to work in the area of cryptography with a focus on privacy-preserving biometrics. More precisely, the researcher will be employed in the European FP7 project BEAT (Biometric Evaluation and Testing). The researcher is expected to investigate and analyse the security and privacy of existing privacy-preserving biometric authentication systems against different types of attacks and propose new ones robust to the identified weaknesses.

Some info about the BEAT research project can be found here: http://www.beat-eu.org

More info about the research of the group can be found here: http://lasecwww.epfl.ch/~katerina/Publications.html

The employment is limited to 1 year and may be extended to 1 more year.

The applicant should have Ph.D. degree preferably in information security, computer science, cryptography or equivalent by the start of the appointment. Experience in security communication protocols, provable security, homomorphic encryption, zero-knowledge proofs, privacy-preservation and biometric authentication is highly valued.





2013-08-19
08:59 [Job][New] 1 Post-Doc position in Privacy-preserving biometrics , Chalmers University of Technology, Sweden

  We are looking for an excellent, motivated, self-driven post-doctoral researcher to work in the area of cryptography with a focus on privacy-preserving biometrics. More precisely, the researcher will be employed in the European FP7 project BEAT (Biometric Evaluation and Testing). The researcher is expected to investigate and analyse the security and privacy of existing privacy-preserving biometric authentication systems against different types of attacks and propose new ones robust to the identified weaknesses.

Some info about the BEAT research project can be found here: http://www.beat-eu.org

More info about the research of the group can be found here: http://lasecwww.epfl.ch/~katerina/Publications.html

The employment is limited to 1 year and may be extended to 1 more year.

The applicant should have Ph.D. degree preferably in information security, computer science, cryptography or equivalent by the start of the appointment. Experience in security communication protocols, provable security, homomorphic encryption, zero-knowledge proofs, privacy-preservation and biometric authentication is highly valued.