Public-key Cryptography from Different Assumptions - A Multi-bit Version

Herve Chabanne, Gerard Cohen, Alain Patey

2013

Abstract

At STOC 2010, Applebaum, Barak and Wigderson introduced three new public-key cryptosystems based on combinatorial assumptions. In their paper, only encryption of bits has been considered. In this paper, we focus on one of their schemes and adapt it to encrypt a constant number of bits in a single ciphertext without changing the size of the public key. We add wire-tap channel techniques to improve the security level of our scheme, thus reaching indistinguishability. We show that it is homomorphic for the XOR operation on bit strings. We also suggest concrete parameters for a first instantiation of our scheme.

Paper Citation

in Harvard Style

Chabanne H., Cohen G. and Patey A. (2013). Public-key Cryptography from Different Assumptions - A Multi-bit Version . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 561-567. DOI: 10.5220/0004600205610567

in Bibtex Style

@conference{secrypt13,
author={Herve Chabanne and Gerard Cohen and Alain Patey},
title={Public-key Cryptography from Different Assumptions - A Multi-bit Version},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={561-567},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004600205610567},
isbn={978-989-8565-73-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Public-key Cryptography from Different Assumptions - A Multi-bit Version
SN - 978-989-8565-73-0
AU - Chabanne H.
AU - Cohen G.
AU - Patey A.
PY - 2013
SP - 561
EP - 567
DO - 10.5220/0004600205610567