On the Decentralized Generation of theRSA Moduli in Multi-Party Settings

12/24/2019
by   Vidal Attias, et al.
0

RSA cryptography is still widely used. Some of its applications (e.g., distributed signature schemes, cryptosystems) do not allow the RSA modulus to be generated by a centralized trusted entity. Instead, the factorization must remain unknown to all the network participants. To this date, the existing algorithms are either computationally expensive, or limited to two-party settings. In this work, we design a decentralized multi-party computation algorithm able to generate efficiently the RSA modulus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2020

Threshold ECDSA with an Offline Recovery Party

A (t,n)- threshold signature scheme enables distributed signing among n ...
research
06/28/2018

When Can a Distributed Ledger Replace a Trusted Third Party?

The functionality that distributed ledger technology provides, i.e., an ...
research
07/13/2021

On SDVS Sender Privacy In The Multi-Party Setting

Strong designated verifier signature schemes rely on sender-privacy to h...
research
09/02/2020

A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party

A (t,n)-threshold signature scheme enables distributed signing among n p...
research
02/10/2022

Spoiler Susceptibility in Multi-District Party Elections

Electoral spoilers are such agents that there exists a coalition of agen...
research
09/16/2023

Improving Section 230, Preserving Democracy and Protecting Free Speech

This article proposes a framework for content moderation based on a dece...
research
01/22/2023

VeraSel: Verifiable Random Selection for Mixnets Construction

The security and performance of Mixnets depends on the trustworthiness o...

Please sign up or login with your details

Forgot password? Click here to reset