We present a simple solution to secretly sharing a factoring witness (for given N) in a publicly-verifiable manner. Compared to the previous PVSS schemes to secretly sharing a factoring witness, the scheme enjoys the following properties: (1) the formal proofs of security can be given; (2) it is designed to be conceptually simpler; (3) it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 219+1) is used in the previous schemes, fewer computations; (4) no general multi-party computation is required in the preparation phase.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Eiichiro FUJISAKI, "A Simple Approach to Secretly Sharing a Factoring Witness in a Publicly-Verifiable Manner" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 1041-1049, May 2002, doi: .
Abstract: We present a simple solution to secretly sharing a factoring witness (for given N) in a publicly-verifiable manner. Compared to the previous PVSS schemes to secretly sharing a factoring witness, the scheme enjoys the following properties: (1) the formal proofs of security can be given; (2) it is designed to be conceptually simpler; (3) it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 219+1) is used in the previous schemes, fewer computations; (4) no general multi-party computation is required in the preparation phase.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_1041/_p
Copy
@ARTICLE{e85-a_5_1041,
author={Eiichiro FUJISAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Simple Approach to Secretly Sharing a Factoring Witness in a Publicly-Verifiable Manner},
year={2002},
volume={E85-A},
number={5},
pages={1041-1049},
abstract={We present a simple solution to secretly sharing a factoring witness (for given N) in a publicly-verifiable manner. Compared to the previous PVSS schemes to secretly sharing a factoring witness, the scheme enjoys the following properties: (1) the formal proofs of security can be given; (2) it is designed to be conceptually simpler; (3) it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 219+1) is used in the previous schemes, fewer computations; (4) no general multi-party computation is required in the preparation phase.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Simple Approach to Secretly Sharing a Factoring Witness in a Publicly-Verifiable Manner
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1041
EP - 1049
AU - Eiichiro FUJISAKI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - We present a simple solution to secretly sharing a factoring witness (for given N) in a publicly-verifiable manner. Compared to the previous PVSS schemes to secretly sharing a factoring witness, the scheme enjoys the following properties: (1) the formal proofs of security can be given; (2) it is designed to be conceptually simpler; (3) it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 219+1) is used in the previous schemes, fewer computations; (4) no general multi-party computation is required in the preparation phase.
ER -