A Simple Approach to Secretly Sharing a Factoring Witness in a Publicly-Verifiable Manner(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 [4],[13], the scheme enjoys the following properties: ● the formal proofs of security can be given; ● it is designed to be conceptually simpler; ● it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 2^<19> +1) is used in the previous schemes, fewer computations; ● no general multi-party computation is required in the preparation phase.

• 社団法人電子情報通信学会の論文
• 2002-05-01

著者

• Fujisaki Eiichiro

  The Author Is With Ntt Laboratories Ntt Corporation

関連論文

• A Chosen-Cipher Secure Encryption Scheme Tightly as Secure as Factoring : Special Section on Cryptography and Information Security
• A Simple Approach to Secretly Sharing a Factoring Witness in a Publicly-Verifiable Manner(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク