Fast Cramer-Shoup Cryptosystem

Pascal Lafourcade; Léo Robert; Demba Sow

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Fast Cramer-Shoup Cryptosystem

Topics: Applied Cryptography

In Proceedings of the 18th International Conference on Security and Cryptography SECRYPT - Volume 1, 766-771, 2021

Authors: Pascal Lafourcade ¹ ; Léo Robert ¹ and Demba Sow ²

Affiliations: ¹ Université Clermont Auvergne, LIMOS CNRS (UMR 6158), Campus des Cézeaux, Aubière, France ; ² LACGAA, Université Cheikh Anta Diop de Dakar, Senegal

Keyword(s): Public Key Encryption, Cramer-Shoup, IND-CCA2.

Abstract: Cramer-Shoup was the first practical adaptive CCA-secure public key encryption scheme. We propose a faster version of this encryption scheme, called Fast Cramer-Shoup. We show empirically and theoretically that our scheme is faster than three versions proposed by Cramer-Shoup in 1998. We observe an average gain of 60% for the decryption algorithm. We prove the IND-CCA2 security of our scheme. The proof only relies on intractability assumptions like DDH.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.149.234.251

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Lafourcade, P.; Robert, L. and Sow, D. (2021). Fast Cramer-Shoup Cryptosystem. In Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT; ISBN 978-989-758-524-1; ISSN 2184-7711, SciTePress, pages 766-771. DOI: 10.5220/0010580607660771

@conference{secrypt21,
author={Pascal Lafourcade. and Léo Robert. and Demba Sow.},
title={Fast Cramer-Shoup Cryptosystem},
booktitle={Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT},
year={2021},
pages={766-771},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010580607660771},
isbn={978-989-758-524-1},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT
TI - Fast Cramer-Shoup Cryptosystem
SN - 978-989-758-524-1
IS - 2184-7711
AU - Lafourcade, P.
AU - Robert, L.
AU - Sow, D.
PY - 2021
SP - 766
EP - 771
DO - 10.5220/0010580607660771
PB - SciTePress