Verifiable partial sharing of integer factors

DOI10.1007/3-540-48892-8_8MaRDI QIDQ4250809zbMATH OpenFDO

Authors Wenbo Mao

Publication date 2 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48892-8_8

zbMATH Keywords

cryptanalysispartial key escrowpartial sharing of integer factorsverifiability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable partial escrow of integer factors.
• Information-theoretic secure verifiable secret sharing over RSA modulus
• Guaranteed correct sharing of integer factorization with off-line shareholders
• Non-interactive and information-theoretic secure verifiable secret sharing

Cited in

(4)

• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Implicit Factoring with Shared Most Significant and Middle Bits
• Guaranteed correct sharing of integer factorization with off-line shareholders
• Verifiable partial escrow of integer factors.

This page was built for publication: Verifiable partial sharing of integer factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250809)