Robust and efficient sharing of RSA functions.
From MaRDI portal
Recommendations
Cited in
(23)- Partially non-interactive two-round lattice-based threshold signatures
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Threshold RSA for Dynamic and Ad-Hoc Groups
- scientific article; zbMATH DE number 2048539 (Why is no real title available?)
- Practical (fully) distributed signatures provably secure in the standard model
- Boneh-Franklin IBE
- Virtual smart cards: how to sign with a password and a server
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- An ideal and robust threshold RSA
- Practical Schnorr threshold signatures without the algebraic group model
- Computing inverses over a shared secret modulus
- Public Key Cryptography - PKC 2005
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Distributing the encryption and decryption of a block cipher
- Better than advertised security for non-interactive threshold signatures
- Practical threshold signatures
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Robust and efficient sharing of RSA functions
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Efficient certificateless threshold signatures without random oracles
- Shared generation of pseudo-random functions
- Efficient and adaptive threshold signatures for ad hoc networks
This page was built for publication: Robust and efficient sharing of RSA functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976268)
