Multiparty Generation of an RSA Modulus

Chen, Megan; Cohen, Ran; Doerner, Jack; Kondi, Yashvanth; Lee, Eysa; Rosefield, Schuyler; Shelat, Abhi

doi:10.1007/s00145-021-09395-y

Cited by 7 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proof of sequential work [39,28], trapdoorless VDF or in trustless group of unknown order [22,31] or in MPC-generated RSA groups [26,49] NP-complete problems; Proof-of-Work [32]; witness or PoW encryption [35,38] Proof-of-Space [33]; Equihash, ethash [16,34]; MTP/Itsuku [15,27] [unknown] Proof of storage [37] Trapdoored Moderate/Hard See Section 3.1…”

Section: Easymentioning

confidence: 99%

PURED: A Unified Framework for Resource-Hard Functions

Biryukov,

Lombard-Platet

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Algorithm hardness can be described by 5 categories: hardness in computation, in sequential computation, in memory, in energy consumption (or bandwidth), in code size. Similarly, hardness can be a concern for solving or for verifying, depending on the context, and can depend on a secret trapdoor or be universally hard. Two main lines of research investigated such problems: cryptographic puzzles, that gained popularity thanks to blockchain consensus systems (where solving must be moderately hard, and verification either public or private), and white box cryptography (where solving must be hard without knowledge of the secret key). In this work, we improve upon the classification framework proposed by Biryukov and Perrin in Asiacypt 2017 and offer a united hardness framework, PURED, that can be used for measuring all these kinds of hardness, both in solving and verifying. We also propose three new constructions that fill gaps previously uncovered by the literature (namely, trapdoor proof of CMC, trapdoor proof of code, and a hard challenge in sequential time trapdoored in verification), and analyse their hardness in the PURED framework.

show abstract

Section: Easymentioning

confidence: 99%

PURED: A Unified Framework for Resource-Hard Functions

Biryukov,

Lombard-Platet

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Lightweight authentication schemes become highly demanded to implement the mutual authentication in SGS. In the past decades, although many lightweight authentication schemes have been proposed, 4‐33 the majority of them have their own problems. In Gope's scheme, 18 the AG needs to verify the effectiveness of the SMs before communication, which will make the computational complexity linear in the number of SMs.…”

Section: Related Workmentioning

confidence: 99%

“…Chebyshev polynomials cryptosystem over the finite field was first proposed by Kocarev and Tasev, 24 which can be also utilized for authentication scheme designing in SG. Compared with other public key encryption system, such as RSA [25][26][27] and ECC, 6,9,[20][21][22][23] under the same security premise, Chebyshev polynomials cryptosystem has higher efficiency using a shorter key length and shorter verification time. Bayat et al 28 first introduced a chaotic maps based authenticated key exchange protocol for SG.…”

Section: Related Workmentioning

confidence: 99%