Hashing solutions instead of generating problems : On the interactive certification of RSA moduli. / Auerbach, Benedikt; Poettering, Bertram.

2018. 403-430 Paper presented at PKC 2018, .

Research output: Contribution to conferencePaper

Published

Documents

  • rsacheck

    Accepted author manuscript, 542 KB, PDF-document

Links

Abstract

Certain RSA-based protocols, for instance in the domain of group signatures, require a prover to convince a verifier that a set of RSA parameters is well-structured (e.g., that the modulus is the product of two distinct primes and that the exponent is co-prime to the group order). Various corresponding proof systems have been proposed in the past, with different levels of generality, efficiency, and interactivity.

This paper proposes two new proof systems for a wide set of properties that RSA and related moduli might have. The protocols are particularly efficient: The necessary computations are simple, the communication is restricted to only one round, and the exchanged messages are short. While the first protocol is based on prior work (improving on it by reducing the number of message passes from four to two), the second protocol is novel. Both protocols require a random oracle.
Original languageEnglish
Pages403-430
Number of pages27
DOIs
StatePublished - 1 Mar 2018
EventPKC 2018 -
Duration: 25 Mar 201828 Mar 2018

Conference

ConferencePKC 2018
Period25/03/1828/03/18
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 29298158