International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) 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).

08:26 [Event][New] ISCTURKEY: International Conference on Information Security and Cryptology

  Submission: 1 April 2013
Notification: 23 April 2013
From May 23 to May 24
Location: Ankara, Turkey
More Information:

08:25 [Event][New] ICIA2013: The Second International Conference on Informatics & Applications

  Submission: 5 August 2013
Notification: 15 September 2013
From September 23 to September 25
Location: Lodz, Poland
More Information:

00:17 [Pub][JoC] A One-Time Stegosystem and Applications to Efficient Covert Communication


Abstract  We present the first information-theoretic steganographic protocol with an asymptotically optimal ratio of key length to message length that operates on arbitrary covertext distributions with constant min-entropy. Our results are also applicable to the computational setting: our stegosystem can be composed over a pseudorandom generator to send longer messages in a computationally secure fashion. In this respect our scheme offers a significant improvement in terms of the number of pseudorandom bits generated by the two parties in comparison to previous results known in the computational setting. Central to our approach for improving the overhead for general distributions is the use of combinatorial constructions that have been found to be useful in other contexts for derandomization: almost t-wise independent function families.

  • Content Type Journal Article
  • Pages 1-22
  • DOI 10.1007/s00145-012-9135-4
  • Authors

    • Aggelos Kiayias, Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
    • Yona Raekow, Fraunhofer Institute for Algorithms and Scientific Computing, St. Augustin, Germany
    • Alexander Russell, Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
    • Narasimha Shashidhar, Department of Computer Science, Sam Houston State University, Huntsville, TX, USA

    • Journal Journal of Cryptology
    • Online ISSN 1432-1378
    • Print ISSN 0933-2790

From: Wed, 24 Oct 2012 17:55:35 GMT

15:17 [Pub][ePrint] Secure Outsourced Attribute-Based Signatures, by Jin Li, Xiaofeng Chen, Jingwei Li, Chunfu Jia, Duncan S. Wong, Willy Susilo

  Attribute-based signature (ABS) is a useful variant of digital signature, which enables users to sign messages over attributes without revealing any information other than the fact that they have attested to the messages. However, heavy computational cost is required during signing in existing work of ABS, which grows linearly with the size of the predicate formula. As a result, this presents a significant challenge for resource-limited users (such as mobile devices) to perform such heavy computation independently. Aiming at tackling the challenge above, we propose and formalize a

new paradigm called OABS, in which the computational overhead at user side is greatly reduced through outsourcing such intensive computation to an untrusted signing-cloud service provider (S-CSP). Furthermore, we apply this novel paradigm to existing ABS to reduce complexity and present two schemes, i) in the first OABS scheme, the number of exponentiations involving in signing is reduced from $O(d)$ to $O(1)$ (nearly three), where $d$ is the upper bound of threshold value defined in the predicate; ii) our second scheme is built on Herranz et al\'s construction with constant-size signatures. The number of exponentiations in signing is reduced from $O(d^2)$ to $O(d)$ and the communication overhead is $O(1)$. Security analysis demonstrates that both OABS schemes are secure in terms of the unforgeability and attribute-signer privacy definitions specified in the proposed security model. Finally, to allow for high efficiency and flexibility, we discuss extensions of OABS and show how to achieve accountability and outsourced verification as well.

15:17 [Pub][ePrint] Breaking Public Keys - How to Determine an Unknown RSA Public Modulus, by Hans-Joachim Knobloch

  Not surprisingly, the common use of any public key crypto system involves publishing the public key and keeping the private key secret. There are however a few applications where both the private and public key are kept secret, thereby effectively converting a public key crypto algorithm to a symmetric algorithm.

We show that if the RSA cryptosystem is used in such a symmetric application, it is possible to determine the public RSA modulus if the public exponent is known and short, such as 3 or F4=65537, and two or more plaintext/ciphertext (or, if RSA is used for signing, signed value/signature) pairs are known.

15:17 [Pub][ePrint] A Novel Approach for RSA-based Certificateless Signature Scheme, by Nishant Doshi

  In the conventional signature scheme, the sender will sign the message and send it to the receiver, who is verify based on the certificate of the sender (provided by trusted third party prior to communication). However, this lead to a certificate management problem as third party need to maintain all certificates and if there are many third parties (hierarchical). The solution to this problem lead to a certificateless signature scheme in which receiver only requires ID (unique identity) of the sender. The approaches in literatures are based on the bilinear map. However, the time for pairing is more as that of the exponent operation of the RSA (Public Key Cryptography) scheme. Recently, Zhang et al, proposed the RSA-based certificateless scheme. We show that this scheme is insecure and proposed the scheme that overcomes the attack on Zhang et al\'s scheme.

15:17 [Pub][ePrint] An Efficient Three-Party Authenticated Key Exchange Protocol for Mobile-Commerce Environments Using Elliptic Curve Cryptography, by Nishant Doshi

  In the three party authentication key exchange

(3PAKE) protocol, more than two parties can communicate and

set up common shared secret key using the server. Recently,

Tan et al. proposed an enhanced 3PAKE scheme based on

elliptic curve cryptography (ECC) to minimize the operations and

make compatible for mobile commerce environments. However,

Nose showed the scheme of Tan et al. is susceptible to the

impersonation attack and the man-in-middle attack. However, in

this paper we have shown that Tan et al. protocol is susceptible to

the known session-specific temporary information attack and the

clock synchronization attack too. Afterwards, we have proposed

the protocol that withstands against the above mentioned attacks.

In addition, our proposed approach is based on the hash function

in place of the encryption/decryption function that was used in

Tan et al. scheme.

15:17 [Pub][ePrint] Biclique Cryptanalysis of the PRESENT and LED Lightweight Ciphers, by Farzaneh Abed and Christian Forler and Eik List and Stefan Lucks and Jakob Wenzel

  In this paper, we propose the first full-round attacks on the PRESENT and LED lightweight ciphers. In our attacks, we use the independent-biclique approach which has been developed recently. The proposed attacks on PRESENT-80 and PRESENT-128 require $2^{60}$ and $2^{56}$ chosen plaintexts, and have time complexities of $2^{79.54}$ and $2^{127.42}$, respectively. Our attacks on LED-64 and LED-128 need $2^{56}$ and $2^{64}$ chosen plaintexts and the time complexities are equivalent to $2^{63.40}$ and $2^{127.25}$ encryptions.

15:17 [Pub][ePrint] Attribute-Based Encryption for Circuits from Multilinear Maps, by Amit sahai and Brent Waters

  In this work, we provide the first construction of Attribute-Based

Encryption (ABE) for general circuits. Our construction is based on

the existence of multilinear maps. We prove selective security of

our scheme in the standard model under the natural multilinear

generalization of the BDDH assumption. Our scheme achieves both

Key-Policy and Ciphertext-Policy variants of ABE.

15:17 [Pub][ePrint] Factor-4 and 6 (De)compression for Values of Pairings using Trace Maps, by Tomoko Yonemura and Taichi Isogai and Hirofumi Muratani and Yoshikazu Hanatani

  The security of pairing-based cryptosystems relies on the hardness of the discrete logarithm problems in elliptic curves and in finite fields related to the curves, namely, their embedding fields. Public keys and ciphertexts in the pairing-based cryptosystems are composed of points on the curves or values of pairings. Although the values of the pairings belong to the embedding fields, the representation of the field is inefficient in size because the size of the embedding fields is usually larger than the size of the elliptic curves. We show factor-4 and 6 compression and decompression for the values of the pairings with the supersingular elliptic curves of embedding degrees 4 and 6, respectively. For compression, we use the fact that the values of the pairings belong to algebraic tori

that are multiplicative subgroups of the embedding fields. The algebraic tori can be expressed by the affine representation or the trace representation. Although the affine representation allows decompression maps, decompression maps for the trace representation has not been known. In this paper, we propose a trace representation with decompression maps for the characteristics 2 and 3. We first construct efficient decompression maps for trace maps by adding extra information to the trace representation. Our decompressible trace representation with additional information is as efficient as the affine representation is in terms of the costs of compression, decompression and exponentiation, and the size.

15:17 [Pub][ePrint] Improved Impossible Differential Attack on Reduced Version of Camellia-192/256, by Ya Liu and Dawu Gu and Zhiqiang Liu and Wei Li

  As an ISO/IEC international standard, Camellia has been used various cryptographic applications. In this paper, we improve previous attacks on Camellia-192/256 with key-dependent layers $FL/FL^{-1}$ by using the intrinsic weakness of keyed functions. Specifically, we present the first impossible differential attack on 13-round Camellia with $2^{121.6}$ chosen ciphertexts and $2^{189.9}$ 13-round encryptions, while the analysis for the biggest number of rounds in previous results on Camellia-192 worked on 12 rounds. Furthermore, we successfully attack 14-round Camellia-256 with $2^{122.1}$ chosen ciphertexts and $2^{229.3}$ 14-round encryptions. Compared with the previously best known attack on 14-round Camellia-256, the time complexity of our attack is reduced by $2^{8.9}$ times and the data complexity is comparable.