Verifiable partial escrow of integer factors.

DOI10.1023/A:1011235607071MaRDI QIDQ5960287zbMATH OpenOpenAlexFDO

Authors Wenbo Mao

Publication date 15 April 2002

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011235607071

zbMATH Keywords

time complexityverifiable partial escrow

Mathematics Subject Classification ID

Factorization (11Y05) Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1304111
• scientific article; zbMATH DE number 1107708
• Verifiably multiplicative secret sharing
• Verifiably Multiplicative Secret Sharing
• Improved primitives for secure multiparty integer computation
• scientific article; zbMATH DE number 1186869
• A secure and efficient proof of integer in an interval range
• Escrowed deniable identification schemes
• Verifiable computation in multiparty protocols with honest majority
• Provably Secure Key Assignment Schemes from Factoring

Cited in

(1)

• scientific article; zbMATH DE number 1304111 (Why is no real title available?)

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

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