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