Verifiable partial escrow of integer factors.

DOI10.1023/A:1011235607071zbMath1033.94009OpenAlexW2009046296MaRDI QIDQ5960287

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

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

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