Optimizing robustness while generating shared secret safe primes

DOI10.1007/978-3-540-30580-4_9MaRDI QIDQ5711590zbMATH OpenOpenAlexFDO

Authors Emil Ong, John D. Kubiatowicz

Publication date 7 December 2005

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

Full work available at URL https://doi.org/10.1007/b105124

zbMATH Keywords

Distributed key generationsafe primesthreshold RSA signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Robust and efficient sharing of RSA functions.
• Efficient computation modulo a shared secret with application to the generation of shared safe-prime products
• Efficient threshold RSA signatures with general moduli and no extra assumptions
• Practical threshold RSA signatures without a trusted dealer
• Practical threshold signatures

Cited in

(3)

• Generating safe primes
• A dynamic prime number based efficient security mechanism for big sensing data streams
• Efficient computation modulo a shared secret with application to the generation of shared safe-prime products

This page was built for publication: Optimizing robustness while generating shared secret safe primes

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