ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Rerandomizable Signatures Under Standard Assumption

Chatterjee, S and Kabaleeshwaran, R (2019) Rerandomizable Signatures Under Standard Assumption. In: 20th International Conference on Cryptology in India, INDOCRYPT 2019, 15 - 18 December 2019, Hyderabad, pp. 45-67.

[img] PDF
INDOCRYPT_2019.pdf - Published Version
Restricted to Registered users only

Download (749kB) | Request a copy
Official URL: https://doi.org/10.1007/978-3-030-35423-7_3


The Camenisch-Lysyanskaya rerandomizable signature (CL-RRS) scheme is an important tool in the construction of privacy preserving protocols. One of the limitations of CL-RRS is that the signature size is linear in the number of messages to be signed. In 2016, Pointcheval-Sanders introduced a variant of rerandomizable signature (PS-RRS) scheme which removes the above limitation. However, the security of PS-RRS scheme was proved under an interactive assumption. In 2018, Pointcheval-Sanders improved this to give a reduction under a parameterized assumption. In 2012, Gerbush et al. introduced the dual-form signature technique to remove the dependency on interactive/parameterized assumption. They applied this technique on the CL-RRS scheme (for single message) and proved its unforgeability under static assumptions instead of the interactive assumption used in the original work but in the symmetric composite-order pairing setting. In this work, we realize a fully rerandomizable signature scheme in the prime order setting without random oracle based on the SXDH assumption. The signature structure is derived from Ghadafi’s structure-preserving signature. We first apply the dual-form signature technique to obtain a composite-order variant, called RRSc. A signature in RRSc consists of only two group elements and is thus independent of the message block length. The security of the proposed scheme is based on subgroup hiding assumptions. Then we use the dual pairing vector space framework to obtain a prime-order variant called RRS and prove its security under the SXDH assumption.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer
Additional Information: The copyright for this article belongs to Springer.
Keywords: Cryptography; Sanders; Vector spaces, Dual form; Parameterized; Privacy-preserving protocols; Rerandomizable signatures; Signature Scheme; Standard assumptions; Structure-preserving; Without random oracles, Network security
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 05 Dec 2022 05:46
Last Modified: 05 Dec 2022 05:46
URI: https://eprints.iisc.ac.in/id/eprint/78206

Actions (login required)

View Item View Item