Guaranteed correct sharing of integer factorization with off-line shareholders

DOI10.1007/BFB0054015MaRDI QIDQ3840079zbMATH OpenFDO

Authors Wenbo Mao

Publication date 1998

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1431/14310060.htm

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• Efficient publicly verifiable secret sharing schemes with fast or delayed recovery
• Verifiable partial sharing of integer factors
• Publicly verifiable secret sharing
• Non-interactive and information-theoretic secure verifiable secret sharing

Cited in

(7)

• Efficient schemes for anonymous yet authorized and bounded use of cloud resources
• Secure authenticated comparisons
• Practical Range Proof for Cryptocurrency Monero with Provable Security
• Verifiable partial sharing of integer factors
• Efficient Non-interactive Range Proof
• Verifiable partial escrow of integer factors.
• On server trust in private proxy auctions

This page was built for publication: Guaranteed correct sharing of integer factorization with off-line shareholders

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